java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 07:55:02,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 07:55:02,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 07:55:02,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 07:55:02,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 07:55:02,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 07:55:02,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 07:55:02,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 07:55:02,980 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 07:55:02,981 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 07:55:02,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 07:55:02,984 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 07:55:02,985 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 07:55:02,986 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 07:55:02,987 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 07:55:02,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 07:55:02,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 07:55:02,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 07:55:02,999 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 07:55:03,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 07:55:03,005 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 07:55:03,009 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 07:55:03,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 07:55:03,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 07:55:03,015 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 07:55:03,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 07:55:03,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 07:55:03,018 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 07:55:03,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 07:55:03,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 07:55:03,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 07:55:03,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 07:55:03,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 07:55:03,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 07:55:03,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 07:55:03,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 07:55:03,030 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-19 07:55:03,058 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 07:55:03,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 07:55:03,059 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 07:55:03,059 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 07:55:03,059 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 07:55:03,059 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 07:55:03,060 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 07:55:03,060 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 07:55:03,060 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-19 07:55:03,060 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 07:55:03,061 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 07:55:03,061 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 07:55:03,061 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 07:55:03,062 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 07:55:03,062 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 07:55:03,062 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 07:55:03,062 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 07:55:03,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 07:55:03,063 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 07:55:03,063 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 07:55:03,063 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 07:55:03,063 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 07:55:03,064 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 07:55:03,064 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 07:55:03,064 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 07:55:03,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 07:55:03,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 07:55:03,065 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 07:55:03,065 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 07:55:03,065 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 07:55:03,065 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 07:55:03,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 07:55:03,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 07:55:03,066 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 07:55:03,066 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 07:55:03,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 07:55:03,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 07:55:03,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 07:55:03,129 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 07:55:03,130 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 07:55:03,131 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label53_true-unreach-call.c [2018-09-19 07:55:03,477 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd2aa0f8/142b7968b808453ba24db824d5d23f32/FLAG159b2ab35 [2018-09-19 07:55:03,844 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 07:55:03,845 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label53_true-unreach-call.c [2018-09-19 07:55:03,868 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd2aa0f8/142b7968b808453ba24db824d5d23f32/FLAG159b2ab35 [2018-09-19 07:55:03,891 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd2aa0f8/142b7968b808453ba24db824d5d23f32 [2018-09-19 07:55:03,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 07:55:03,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 07:55:03,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 07:55:03,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 07:55:03,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 07:55:03,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:55:03" (1/1) ... [2018-09-19 07:55:03,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a69133f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:03, skipping insertion in model container [2018-09-19 07:55:03,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:55:03" (1/1) ... [2018-09-19 07:55:03,937 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 07:55:04,689 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:55:04,708 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 07:55:04,942 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:55:05,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05 WrapperNode [2018-09-19 07:55:05,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 07:55:05,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 07:55:05,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 07:55:05,063 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 07:55:05,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (1/1) ... [2018-09-19 07:55:05,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (1/1) ... [2018-09-19 07:55:05,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 07:55:05,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 07:55:05,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 07:55:05,274 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 07:55:05,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (1/1) ... [2018-09-19 07:55:05,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (1/1) ... [2018-09-19 07:55:05,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (1/1) ... [2018-09-19 07:55:05,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (1/1) ... [2018-09-19 07:55:05,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (1/1) ... [2018-09-19 07:55:05,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (1/1) ... [2018-09-19 07:55:05,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (1/1) ... [2018-09-19 07:55:05,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 07:55:05,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 07:55:05,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 07:55:05,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 07:55:05,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (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 07:55:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 07:55:05,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 07:55:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 07:55:05,836 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 07:55:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 07:55:05,837 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 07:55:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 07:55:05,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 07:55:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 07:55:05,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 07:55:12,030 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 07:55:12,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:55:12 BoogieIcfgContainer [2018-09-19 07:55:12,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 07:55:12,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 07:55:12,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 07:55:12,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 07:55:12,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 07:55:03" (1/3) ... [2018-09-19 07:55:12,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213694ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:55:12, skipping insertion in model container [2018-09-19 07:55:12,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:55:05" (2/3) ... [2018-09-19 07:55:12,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213694ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:55:12, skipping insertion in model container [2018-09-19 07:55:12,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:55:12" (3/3) ... [2018-09-19 07:55:12,041 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label53_true-unreach-call.c [2018-09-19 07:55:12,052 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 07:55:12,062 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 07:55:12,127 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 07:55:12,128 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 07:55:12,128 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 07:55:12,128 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 07:55:12,128 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 07:55:12,128 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 07:55:12,128 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 07:55:12,129 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 07:55:12,129 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 07:55:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-09-19 07:55:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-19 07:55:12,172 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:55:12,174 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] [2018-09-19 07:55:12,175 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:55:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1710890852, now seen corresponding path program 1 times [2018-09-19 07:55:12,181 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:55:12,182 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-09-19 07:55:12,185 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [431], [433], [1556], [1560], [1566], [1570], [1579], [1580], [1581], [1583] [2018-09-19 07:55:12,217 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:55:12,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:55:12,353 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:55:12,355 INFO L272 AbstractInterpreter]: Visited 43 different actions 43 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 07:55:12,374 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:55:12,497 INFO L232 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 79.87% of their original sizes. [2018-09-19 07:55:12,497 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:55:12,654 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:55:12,656 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:55:12,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 07:55:12,657 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:55:12,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 07:55:12,681 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 07:55:12,682 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 07:55:12,688 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 5 states. [2018-09-19 07:55:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:55:19,895 INFO L93 Difference]: Finished difference Result 1158 states and 2145 transitions. [2018-09-19 07:55:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 07:55:19,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-09-19 07:55:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:55:19,922 INFO L225 Difference]: With dead ends: 1158 [2018-09-19 07:55:19,922 INFO L226 Difference]: Without dead ends: 746 [2018-09-19 07:55:19,934 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 07:55:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-09-19 07:55:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-09-19 07:55:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-09-19 07:55:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1075 transitions. [2018-09-19 07:55:20,049 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1075 transitions. Word has length 44 [2018-09-19 07:55:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:55:20,049 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1075 transitions. [2018-09-19 07:55:20,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 07:55:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1075 transitions. [2018-09-19 07:55:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-19 07:55:20,062 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:55:20,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:55:20,063 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:55:20,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1962263842, now seen corresponding path program 1 times [2018-09-19 07:55:20,064 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:55:20,064 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-09-19 07:55:20,064 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [431], [433], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 07:55:20,069 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:55:20,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:55:20,198 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:55:20,199 INFO L272 AbstractInterpreter]: Visited 99 different actions 284 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 07:55:20,236 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:55:20,452 INFO L232 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 81% of their original sizes. [2018-09-19 07:55:20,453 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:55:20,833 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:55:20,833 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:55:20,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 07:55:20,833 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:55:20,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 07:55:20,835 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 07:55:20,835 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 07:55:20,836 INFO L87 Difference]: Start difference. First operand 744 states and 1075 transitions. Second operand 9 states. [2018-09-19 07:55:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:55:28,970 INFO L93 Difference]: Finished difference Result 1785 states and 3047 transitions. [2018-09-19 07:55:28,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 07:55:28,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-09-19 07:55:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:55:28,980 INFO L225 Difference]: With dead ends: 1785 [2018-09-19 07:55:28,980 INFO L226 Difference]: Without dead ends: 1385 [2018-09-19 07:55:28,985 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-19 07:55:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2018-09-19 07:55:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1372. [2018-09-19 07:55:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-09-19 07:55:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1788 transitions. [2018-09-19 07:55:29,049 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1788 transitions. Word has length 136 [2018-09-19 07:55:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:55:29,050 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 1788 transitions. [2018-09-19 07:55:29,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 07:55:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1788 transitions. [2018-09-19 07:55:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-19 07:55:29,057 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:55:29,058 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 07:55:29,058 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:55:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash -358798139, now seen corresponding path program 1 times [2018-09-19 07:55:29,059 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:55:29,059 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-09-19 07:55:29,059 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [431], [433], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [761], [765], [769], [773], [777], [781], [785], [789], [793], [796], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 07:55:29,064 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:55:29,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:55:29,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 07:55:29,145 INFO L272 AbstractInterpreter]: Visited 110 different actions 322 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 07:55:29,175 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 07:55:29,221 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 07:55:29,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 07:55:29 BoogieIcfgContainer [2018-09-19 07:55:29,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 07:55:29,222 INFO L168 Benchmark]: Toolchain (without parser) took 25316.87 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 979.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -201.5 MB). Peak memory consumption was 777.9 MB. Max. memory is 7.1 GB. [2018-09-19 07:55:29,225 INFO L168 Benchmark]: CDTParser took 0.20 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 07:55:29,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1153.05 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-19 07:55:29,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 210.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 07:55:29,227 INFO L168 Benchmark]: Boogie Preprocessor took 480.62 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.1 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -985.0 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. [2018-09-19 07:55:29,228 INFO L168 Benchmark]: RCFGBuilder took 6277.97 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 245.1 MB). Peak memory consumption was 245.1 MB. Max. memory is 7.1 GB. [2018-09-19 07:55:29,229 INFO L168 Benchmark]: TraceAbstraction took 17188.59 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 146.3 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 396.9 MB). Peak memory consumption was 543.2 MB. Max. memory is 7.1 GB. [2018-09-19 07:55:29,235 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1153.05 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 210.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 480.62 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.1 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -985.0 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6277.97 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 245.1 MB). Peak memory consumption was 245.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17188.59 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 146.3 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 396.9 MB). Peak memory consumption was 543.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 118]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L8] int inputB = 2; [L9] int inputE = 5; [L10] int inputD = 4; [L11] int inputF = 6; [L12] int inputC = 3; [L13] int inputA = 1; [L16] int a15 = 3; [L17] int a18 = -87; [L18] int a16 = 11; [L19] int a12 = 5; [L1770] int output = -1; [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL, EXPR calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L129] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L132] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L135] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L138] COND FALSE !(((((a16==11) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L141] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==7))) [L144] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L147] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L150] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L153] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L156] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L159] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==9))) [L162] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L165] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L168] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L171] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L174] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L177] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L180] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L183] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L186] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L189] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==5))) [L192] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==5))) [L195] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L198] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L201] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L204] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L208] COND FALSE !(((a15==3) && ((a16==12) && ((input == 6) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )))))) [L213] COND FALSE !(((((a15==3) && ((a12==7) && (input == 3))) && (a16==12)) && ((-156 < a18) && (-79 >= a18)) )) [L218] COND FALSE !(((((input == 2) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )))) && (a16==9)) && (a15==4))) [L223] COND FALSE !(((a15==4) && ((((input == 1) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a16==10)) && (a12==5)))) [L229] COND FALSE !(((a16==8) && ((a15==4) && ((a12==8) && ((input == 4) && ((-79 < a18) && (134 >= a18)) ))))) [L235] COND FALSE !((((a12==8) && ((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (input == 1)))) && (a16==8))) [L240] COND FALSE !((( ((-79 < a18) && (134 >= a18)) && ((a16==12) && ((a15==3) && (input == 6)))) && (a12==7))) [L246] COND FALSE !((((a12==7) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11))) && (a15==3))) [L252] COND FALSE !((((a12==5) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 5)) && (a15==4))) && (a16==8))) [L257] COND FALSE !(((a12==5) && ((((input == 1) && (a16==8)) && a18 <= -156 ) && (a15==4)))) [L262] COND FALSE !((( ((-156 < a18) && (-79 >= a18)) && (((a15==3) && (input == 5)) && (a12==7))) && (a16==12))) [L268] COND FALSE !((((((input == 3) && (a16==8)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L274] COND FALSE !(((a16==10) && ((a12==5) && (((input == 3) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4))))) [L279] COND FALSE !(((((a16==8) && ((a12==6) && (input == 2))) && a18 <= -156 ) && (a15==4))) [L285] COND FALSE !((((a15==4) && ((a12==5) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4)))) && (a16==8))) [L290] COND FALSE !((((a12==8) && ((a15==4) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==9))) [L297] COND FALSE !((((((a16==12) && (input == 1)) && (a12==9)) && 134 < a18 ) && (a15==3))) [L303] COND FALSE !(((((a15==4) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==9)) && (a12==5))) [L309] COND FALSE !(( 134 < a18 && ((a12==6) && ((a16==10) && ((input == 1) && (a15==4)))))) [L315] COND FALSE !((((a12==6) && ( a18 <= -156 && ((a16==8) && (input == 1)))) && (a15==4))) [L321] COND FALSE !(((a15==3) && ((a16==12) && ((((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))) && (input == 1))))) [L327] COND FALSE !(((a16==12) && ((a12==9) && ((a15==3) && ((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L333] COND TRUE ((((a16==11) && ((input == 5) && ((-156 < a18) && (-79 >= a18)) )) && (a15==3)) && (a12==5)) [L334] a18 = ((((a18 - -528844) - -67556) * -1)/ 10) [L335] a16 = 8 [L337] RET return -1; [L1781] EXPR calculate_output(input) [L1781] output = calculate_output(input) [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL, EXPR calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L129] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L132] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L135] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L138] COND FALSE !(((((a16==11) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L141] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==7))) [L144] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L147] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L150] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L153] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L156] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L159] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==9))) [L162] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L165] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L168] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L171] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L174] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L177] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L180] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L183] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L186] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L189] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==5))) [L192] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==5))) [L195] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L198] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L201] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L204] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L208] COND FALSE !(((a15==3) && ((a16==12) && ((input == 6) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )))))) [L213] COND FALSE !(((((a15==3) && ((a12==7) && (input == 3))) && (a16==12)) && ((-156 < a18) && (-79 >= a18)) )) [L218] COND FALSE !(((((input == 2) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )))) && (a16==9)) && (a15==4))) [L223] COND FALSE !(((a15==4) && ((((input == 1) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a16==10)) && (a12==5)))) [L229] COND FALSE !(((a16==8) && ((a15==4) && ((a12==8) && ((input == 4) && ((-79 < a18) && (134 >= a18)) ))))) [L235] COND FALSE !((((a12==8) && ((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (input == 1)))) && (a16==8))) [L240] COND FALSE !((( ((-79 < a18) && (134 >= a18)) && ((a16==12) && ((a15==3) && (input == 6)))) && (a12==7))) [L246] COND FALSE !((((a12==7) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11))) && (a15==3))) [L252] COND FALSE !((((a12==5) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 5)) && (a15==4))) && (a16==8))) [L257] COND FALSE !(((a12==5) && ((((input == 1) && (a16==8)) && a18 <= -156 ) && (a15==4)))) [L262] COND FALSE !((( ((-156 < a18) && (-79 >= a18)) && (((a15==3) && (input == 5)) && (a12==7))) && (a16==12))) [L268] COND FALSE !((((((input == 3) && (a16==8)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L274] COND FALSE !(((a16==10) && ((a12==5) && (((input == 3) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4))))) [L279] COND FALSE !(((((a16==8) && ((a12==6) && (input == 2))) && a18 <= -156 ) && (a15==4))) [L285] COND FALSE !((((a15==4) && ((a12==5) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4)))) && (a16==8))) [L290] COND FALSE !((((a12==8) && ((a15==4) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==9))) [L297] COND FALSE !((((((a16==12) && (input == 1)) && (a12==9)) && 134 < a18 ) && (a15==3))) [L303] COND FALSE !(((((a15==4) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==9)) && (a12==5))) [L309] COND FALSE !(( 134 < a18 && ((a12==6) && ((a16==10) && ((input == 1) && (a15==4)))))) [L315] COND FALSE !((((a12==6) && ( a18 <= -156 && ((a16==8) && (input == 1)))) && (a15==4))) [L321] COND FALSE !(((a15==3) && ((a16==12) && ((((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))) && (input == 1))))) [L327] COND FALSE !(((a16==12) && ((a12==9) && ((a15==3) && ((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L333] COND FALSE !(((((a16==11) && ((input == 5) && ((-156 < a18) && (-79 >= a18)) )) && (a15==3)) && (a12==5))) [L338] COND FALSE !(((a16==9) && ((((input == 3) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9)))) [L345] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) && (a12==8)) || (( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8)))) && (input == 3)) && (a15==3)) && (a16==12))) [L350] COND FALSE !(((a16==11) && (((a12==8) && ((input == 1) && (a15==3))) && a18 <= -156 ))) [L356] COND FALSE !((((((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 4)) && (a15==3)) && (a16==12))) [L361] COND FALSE !((((a15==4) && (((input == 3) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (a12==7))) && (a16==8))) [L367] COND FALSE !(((a16==8) && ((( ((-79 < a18) && (134 >= a18)) && (input == 3)) && (a12==9)) && (a15==4)))) [L373] COND FALSE !(((a16==8) && ((a12==6) && ((a15==4) && ((input == 2) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L380] COND FALSE !((((a16==12) && (((( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )) && (input == 1))) && (a15==3))) [L386] COND TRUE ((a15==3) && (((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11)) && (a12==5))) [L387] a18 = ((((a18 % 38)- 116) - 2) - -1) [L388] a12 = 7 [L390] RET return 22; [L1781] EXPR calculate_output(input) [L1781] output = calculate_output(input) [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND TRUE ((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8)) [L118] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. UNKNOWN Result, 17.0s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 15.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 779 SDtfs, 2077 SDslu, 539 SDs, 0 SdLazy, 6422 SolverSat, 1243 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1372occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9961558006353984 AbsIntWeakeningRatio, 0.19101123595505617 AbsIntAvgWeakeningVarsNumRemoved, 15.92134831460674 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 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/Problem16_label53_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_07-55-29-266.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label53_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_07-55-29-266.csv Received shutdown request...