java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label24_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 04:07:19,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 04:07:19,180 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 04:07:19,203 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 04:07:19,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 04:07:19,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 04:07:19,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 04:07:19,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 04:07:19,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 04:07:19,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 04:07:19,217 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 04:07:19,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 04:07:19,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 04:07:19,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 04:07:19,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 04:07:19,221 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 04:07:19,222 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 04:07:19,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 04:07:19,226 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 04:07:19,228 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 04:07:19,229 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 04:07:19,230 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 04:07:19,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 04:07:19,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 04:07:19,234 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 04:07:19,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 04:07:19,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 04:07:19,237 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 04:07:19,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 04:07:19,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 04:07:19,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 04:07:19,240 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 04:07:19,240 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 04:07:19,240 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 04:07:19,242 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 04:07:19,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 04:07:19,243 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-19 04:07:19,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 04:07:19,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 04:07:19,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 04:07:19,273 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 04:07:19,273 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 04:07:19,273 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 04:07:19,275 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 04:07:19,275 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 04:07:19,275 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 04:07:19,275 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 04:07:19,275 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 04:07:19,276 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 04:07:19,277 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 04:07:19,277 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 04:07:19,278 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 04:07:19,278 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 04:07:19,278 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 04:07:19,278 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 04:07:19,278 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 04:07:19,279 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 04:07:19,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 04:07:19,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 04:07:19,279 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 04:07:19,281 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 04:07:19,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 04:07:19,281 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 04:07:19,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 04:07:19,282 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 04:07:19,282 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 04:07:19,282 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 04:07:19,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 04:07:19,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 04:07:19,283 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 04:07:19,283 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 04:07:19,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 04:07:19,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 04:07:19,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 04:07:19,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 04:07:19,380 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 04:07:19,381 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label24_true-unreach-call_false-termination.c [2018-09-19 04:07:19,766 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f71f621a/dc7c29ac5e4748bfaab03e0efbb7494c/FLAG1de8557c6 [2018-09-19 04:07:20,108 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 04:07:20,109 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label24_true-unreach-call_false-termination.c [2018-09-19 04:07:20,136 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f71f621a/dc7c29ac5e4748bfaab03e0efbb7494c/FLAG1de8557c6 [2018-09-19 04:07:20,162 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f71f621a/dc7c29ac5e4748bfaab03e0efbb7494c [2018-09-19 04:07:20,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 04:07:20,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 04:07:20,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 04:07:20,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 04:07:20,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 04:07:20,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:07:20" (1/1) ... [2018-09-19 04:07:20,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f414e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:20, skipping insertion in model container [2018-09-19 04:07:20,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:07:20" (1/1) ... [2018-09-19 04:07:20,200 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 04:07:20,726 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 04:07:20,745 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 04:07:20,949 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 04:07:21,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21 WrapperNode [2018-09-19 04:07:21,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 04:07:21,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 04:07:21,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 04:07:21,022 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 04:07:21,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (1/1) ... [2018-09-19 04:07:21,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (1/1) ... [2018-09-19 04:07:21,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 04:07:21,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 04:07:21,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 04:07:21,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 04:07:21,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (1/1) ... [2018-09-19 04:07:21,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (1/1) ... [2018-09-19 04:07:21,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (1/1) ... [2018-09-19 04:07:21,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (1/1) ... [2018-09-19 04:07:21,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (1/1) ... [2018-09-19 04:07:21,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (1/1) ... [2018-09-19 04:07:21,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (1/1) ... [2018-09-19 04:07:21,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 04:07:21,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 04:07:21,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 04:07:21,396 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 04:07:21,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (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 04:07:21,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 04:07:21,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 04:07:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 04:07:21,462 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 04:07:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 04:07:21,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 04:07:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 04:07:21,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 04:07:25,243 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 04:07:25,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:07:25 BoogieIcfgContainer [2018-09-19 04:07:25,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 04:07:25,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 04:07:25,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 04:07:25,252 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 04:07:25,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:07:20" (1/3) ... [2018-09-19 04:07:25,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1530daf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:07:25, skipping insertion in model container [2018-09-19 04:07:25,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:07:21" (2/3) ... [2018-09-19 04:07:25,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1530daf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:07:25, skipping insertion in model container [2018-09-19 04:07:25,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:07:25" (3/3) ... [2018-09-19 04:07:25,257 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label24_true-unreach-call_false-termination.c [2018-09-19 04:07:25,265 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 04:07:25,274 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 04:07:25,330 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 04:07:25,331 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 04:07:25,332 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 04:07:25,332 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 04:07:25,332 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 04:07:25,332 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 04:07:25,333 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 04:07:25,333 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 04:07:25,333 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 04:07:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-19 04:07:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-19 04:07:25,371 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:07:25,372 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] [2018-09-19 04:07:25,373 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:07:25,379 INFO L82 PathProgramCache]: Analyzing trace with hash -364363092, now seen corresponding path program 1 times [2018-09-19 04:07:25,382 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:07:25,383 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-09-19 04:07:25,386 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], [285], [287], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-19 04:07:25,452 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:07:25,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:07:26,713 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:07:26,715 INFO L272 AbstractInterpreter]: Visited 47 different actions 47 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 04:07:26,734 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:07:27,503 INFO L232 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 80.39% of their original sizes. [2018-09-19 04:07:27,504 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:07:27,819 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:07:27,821 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:07:27,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 04:07:27,821 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:07:27,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 04:07:27,836 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 04:07:27,837 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 04:07:27,840 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-19 04:07:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:07:31,093 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-19 04:07:31,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 04:07:31,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-09-19 04:07:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:07:31,124 INFO L225 Difference]: With dead ends: 693 [2018-09-19 04:07:31,124 INFO L226 Difference]: Without dead ends: 436 [2018-09-19 04:07:31,131 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 43 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 04:07:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-19 04:07:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-19 04:07:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-19 04:07:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-19 04:07:31,218 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 48 [2018-09-19 04:07:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:07:31,219 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-19 04:07:31,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 04:07:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-19 04:07:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-19 04:07:31,226 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:07:31,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:07:31,227 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:07:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1824784731, now seen corresponding path program 1 times [2018-09-19 04:07:31,228 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:07:31,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2018-09-19 04:07:31,229 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], [285], [287], [290], [298], [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 04:07:31,236 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:07:31,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:07:35,300 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:07:35,301 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 04:07:35,318 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:07:36,376 INFO L232 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 78.44% of their original sizes. [2018-09-19 04:07:36,376 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:07:37,224 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:07:37,225 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:07:37,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 04:07:37,225 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:07:37,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 04:07:37,227 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 04:07:37,227 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 04:07:37,228 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 14 states. [2018-09-19 04:07:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:07:48,063 INFO L93 Difference]: Finished difference Result 1340 states and 2335 transitions. [2018-09-19 04:07:48,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 04:07:48,063 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 133 [2018-09-19 04:07:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:07:48,072 INFO L225 Difference]: With dead ends: 1340 [2018-09-19 04:07:48,073 INFO L226 Difference]: Without dead ends: 1095 [2018-09-19 04:07:48,075 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-09-19 04:07:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-19 04:07:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 850. [2018-09-19 04:07:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-09-19 04:07:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1058 transitions. [2018-09-19 04:07:48,132 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1058 transitions. Word has length 133 [2018-09-19 04:07:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:07:48,133 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1058 transitions. [2018-09-19 04:07:48,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 04:07:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1058 transitions. [2018-09-19 04:07:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-19 04:07:48,142 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:07:48,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:07:48,142 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:07:48,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2118678471, now seen corresponding path program 1 times [2018-09-19 04:07:48,143 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:07:48,143 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-09-19 04:07:48,144 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], [285], [287], [290], [298], [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 04:07:48,152 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:07:48,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:07:53,711 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:07:53,711 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 04:07:53,751 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:07:55,248 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 78.25% of their original sizes. [2018-09-19 04:07:55,248 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:07:55,968 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:07:55,969 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:07:55,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 04:07:55,969 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:07:55,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 04:07:55,972 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 04:07:55,972 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 04:07:55,973 INFO L87 Difference]: Start difference. First operand 850 states and 1058 transitions. Second operand 11 states. [2018-09-19 04:08:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:08:04,510 INFO L93 Difference]: Finished difference Result 1283 states and 1842 transitions. [2018-09-19 04:08:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 04:08:04,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2018-09-19 04:08:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:08:04,531 INFO L225 Difference]: With dead ends: 1283 [2018-09-19 04:08:04,531 INFO L226 Difference]: Without dead ends: 1038 [2018-09-19 04:08:04,534 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-19 04:08:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-09-19 04:08:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1035. [2018-09-19 04:08:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-09-19 04:08:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1256 transitions. [2018-09-19 04:08:04,590 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1256 transitions. Word has length 159 [2018-09-19 04:08:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:08:04,590 INFO L480 AbstractCegarLoop]: Abstraction has 1035 states and 1256 transitions. [2018-09-19 04:08:04,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 04:08:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1256 transitions. [2018-09-19 04:08:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-19 04:08:04,608 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:08:04,608 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 04:08:04,608 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:08:04,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2077333816, now seen corresponding path program 1 times [2018-09-19 04:08:04,609 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:08:04,609 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-09-19 04:08:04,612 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], [285], [287], [290], [298], [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 04:08:04,619 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:08:04,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:08:12,231 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:08:12,231 INFO L272 AbstractInterpreter]: Visited 119 different actions 352 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 04:08:12,256 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:08:13,828 INFO L232 lantSequenceWeakener]: Weakened 242 states. On average, predicates are now at 77.94% of their original sizes. [2018-09-19 04:08:13,828 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:08:14,446 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:08:14,446 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:08:14,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-19 04:08:14,447 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:08:14,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 04:08:14,448 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 04:08:14,448 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-19 04:08:14,449 INFO L87 Difference]: Start difference. First operand 1035 states and 1256 transitions. Second operand 15 states. [2018-09-19 04:08:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:08:24,427 INFO L93 Difference]: Finished difference Result 2597 states and 3738 transitions. [2018-09-19 04:08:24,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-19 04:08:24,436 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 244 [2018-09-19 04:08:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:08:24,454 INFO L225 Difference]: With dead ends: 2597 [2018-09-19 04:08:24,454 INFO L226 Difference]: Without dead ends: 1936 [2018-09-19 04:08:24,459 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 259 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2018-09-19 04:08:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-09-19 04:08:24,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1469. [2018-09-19 04:08:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-09-19 04:08:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1742 transitions. [2018-09-19 04:08:24,520 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1742 transitions. Word has length 244 [2018-09-19 04:08:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:08:24,521 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 1742 transitions. [2018-09-19 04:08:24,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 04:08:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1742 transitions. [2018-09-19 04:08:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-09-19 04:08:24,527 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:08:24,527 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 04:08:24,528 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:08:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 648874139, now seen corresponding path program 1 times [2018-09-19 04:08:24,528 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:08:24,528 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2018-09-19 04:08:24,529 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], [285], [287], [290], [298], [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 04:08:24,538 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:08:24,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:08:29,343 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:08:39,457 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:08:39,457 INFO L272 AbstractInterpreter]: Visited 119 different actions 465 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 04:08:39,464 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:08:41,480 INFO L232 lantSequenceWeakener]: Weakened 267 states. On average, predicates are now at 77.88% of their original sizes. [2018-09-19 04:08:41,480 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:08:41,768 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:08:41,768 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:08:41,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 04:08:41,769 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:08:41,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 04:08:41,770 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 04:08:41,770 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 04:08:41,770 INFO L87 Difference]: Start difference. First operand 1469 states and 1742 transitions. Second operand 10 states. [2018-09-19 04:08:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:08:50,118 INFO L93 Difference]: Finished difference Result 1908 states and 2532 transitions. [2018-09-19 04:08:50,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 04:08:50,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 269 [2018-09-19 04:08:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:08:50,128 INFO L225 Difference]: With dead ends: 1908 [2018-09-19 04:08:50,129 INFO L226 Difference]: Without dead ends: 1663 [2018-09-19 04:08:50,131 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 276 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 04:08:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2018-09-19 04:08:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1656. [2018-09-19 04:08:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-09-19 04:08:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 1960 transitions. [2018-09-19 04:08:50,191 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 1960 transitions. Word has length 269 [2018-09-19 04:08:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:08:50,191 INFO L480 AbstractCegarLoop]: Abstraction has 1656 states and 1960 transitions. [2018-09-19 04:08:50,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 04:08:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1960 transitions. [2018-09-19 04:08:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-09-19 04:08:50,200 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:08:50,200 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 04:08:50,200 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:08:50,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1157590191, now seen corresponding path program 1 times [2018-09-19 04:08:50,201 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:08:50,201 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 348 with the following transitions: [2018-09-19 04:08:50,201 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], [285], [287], [290], [298], [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 04:08:50,211 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:08:50,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:08:55,055 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:09:11,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 04:09:11,515 INFO L272 AbstractInterpreter]: Visited 121 different actions 712 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 04:09:11,523 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 04:09:11,569 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 04:09:11,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:09:11 BoogieIcfgContainer [2018-09-19 04:09:11,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 04:09:11,571 INFO L168 Benchmark]: Toolchain (without parser) took 111398.29 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 04:09:11,573 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 04:09:11,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.46 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 04:09:11,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 04:09:11,576 INFO L168 Benchmark]: Boogie Preprocessor took 256.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -871.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2018-09-19 04:09:11,577 INFO L168 Benchmark]: RCFGBuilder took 3848.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 122.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 7.1 GB. [2018-09-19 04:09:11,578 INFO L168 Benchmark]: TraceAbstraction took 106323.65 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -472.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 04:09:11,583 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.46 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 116.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 256.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -871.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3848.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 122.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106323.65 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -472.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 127]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputD = 4; [L8] int inputB = 2; [L9] int inputC = 3; [L10] int inputF = 6; [L11] int inputE = 5; [L12] int inputA = 1; [L15] int a21 = 7; [L16] int a15 = 8; [L17] int a12 = -49; [L18] int a24 = 1; [L877] int output = -1; [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L451] a21 = 10 [L453] RET return 22; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L445] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L446] a21 = 7 [L448] RET return 25; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND TRUE ((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8)) [L253] a12 = ((((a12 - 438298) * 1) + 564710) - 684902) [L254] a15 = 5 [L255] a21 = 6 [L257] RET return -1; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL 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 TRUE ((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6)) [L127] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 106.2s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 41.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1200 SDtfs, 7612 SDslu, 1518 SDs, 0 SdLazy, 10873 SolverSat, 1829 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 35.5s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 893 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1656occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 54.9s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9942424397792526 AbsIntWeakeningRatio, 0.125 AbsIntAvgWeakeningVarsNumRemoved, 912.5141509433962 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 724 StatesRemovedByMinimization, 5 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_label24_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_04-09-11-600.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label24_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_04-09-11-600.csv Received shutdown request...