./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label30.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74ad95c89e825af3e8bd664b54190b589939097fe089144b4a47194abf94e882 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 13:16:20,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 13:16:20,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 13:16:20,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 13:16:20,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 13:16:20,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 13:16:20,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 13:16:20,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 13:16:20,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 13:16:20,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 13:16:20,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 13:16:20,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 13:16:20,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 13:16:20,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 13:16:20,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 13:16:20,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 13:16:20,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 13:16:20,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 13:16:20,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 13:16:20,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 13:16:20,860 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 13:16:20,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 13:16:20,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 13:16:20,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 13:16:20,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 13:16:20,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 13:16:20,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 13:16:20,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 13:16:20,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 13:16:20,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 13:16:20,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 13:16:20,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 13:16:20,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 13:16:20,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 13:16:20,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 13:16:20,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 13:16:20,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 13:16:20,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 13:16:20,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 13:16:20,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 13:16:20,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 13:16:20,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 13:16:20,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 13:16:20,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 13:16:20,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 13:16:20,902 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 13:16:20,902 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 13:16:20,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 13:16:20,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 13:16:20,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 13:16:20,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 13:16:20,903 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 13:16:20,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 13:16:20,904 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 13:16:20,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 13:16:20,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 13:16:20,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 13:16:20,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 13:16:20,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 13:16:20,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 13:16:20,905 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 13:16:20,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 13:16:20,905 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 13:16:20,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 13:16:20,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 13:16:20,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 13:16:20,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 13:16:20,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 13:16:20,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 13:16:20,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 13:16:20,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 13:16:20,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 13:16:20,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 13:16:20,907 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 13:16:20,907 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 13:16:20,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 13:16:20,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74ad95c89e825af3e8bd664b54190b589939097fe089144b4a47194abf94e882 [2022-07-13 13:16:21,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 13:16:21,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 13:16:21,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 13:16:21,121 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 13:16:21,121 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 13:16:21,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label30.c [2022-07-13 13:16:21,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f6885e5/7d9a7a87880e45e0b739ffc2918d4b65/FLAG5cc097c4d [2022-07-13 13:16:21,649 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 13:16:21,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label30.c [2022-07-13 13:16:21,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f6885e5/7d9a7a87880e45e0b739ffc2918d4b65/FLAG5cc097c4d [2022-07-13 13:16:21,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f6885e5/7d9a7a87880e45e0b739ffc2918d4b65 [2022-07-13 13:16:21,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 13:16:21,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 13:16:21,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 13:16:21,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 13:16:21,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 13:16:21,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:16:21" (1/1) ... [2022-07-13 13:16:21,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9ad2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:21, skipping insertion in model container [2022-07-13 13:16:21,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:16:21" (1/1) ... [2022-07-13 13:16:21,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 13:16:22,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 13:16:22,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label30.c[3774,3787] [2022-07-13 13:16:22,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 13:16:22,523 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 13:16:22,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label30.c[3774,3787] [2022-07-13 13:16:22,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 13:16:22,730 INFO L208 MainTranslator]: Completed translation [2022-07-13 13:16:22,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22 WrapperNode [2022-07-13 13:16:22,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 13:16:22,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 13:16:22,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 13:16:22,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 13:16:22,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:22,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:23,000 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2611 [2022-07-13 13:16:23,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 13:16:23,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 13:16:23,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 13:16:23,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 13:16:23,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:23,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:23,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:23,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:23,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:23,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:23,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:23,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 13:16:23,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 13:16:23,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 13:16:23,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 13:16:23,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (1/1) ... [2022-07-13 13:16:23,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 13:16:23,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:16:23,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 13:16:23,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 13:16:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 13:16:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 13:16:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 13:16:23,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 13:16:23,326 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 13:16:23,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 13:16:25,481 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 13:16:25,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 13:16:25,495 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 13:16:25,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:16:25 BoogieIcfgContainer [2022-07-13 13:16:25,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 13:16:25,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 13:16:25,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 13:16:25,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 13:16:25,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:16:21" (1/3) ... [2022-07-13 13:16:25,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be2d4d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:16:25, skipping insertion in model container [2022-07-13 13:16:25,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:16:22" (2/3) ... [2022-07-13 13:16:25,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be2d4d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:16:25, skipping insertion in model container [2022-07-13 13:16:25,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:16:25" (3/3) ... [2022-07-13 13:16:25,504 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem17_label30.c [2022-07-13 13:16:25,513 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 13:16:25,514 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 13:16:25,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 13:16:25,572 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@386bc367, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b6385ed [2022-07-13 13:16:25,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 13:16:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 13:16:25,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:25,585 INFO L195 NwaCegarLoop]: 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] [2022-07-13 13:16:25,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash -593706766, now seen corresponding path program 1 times [2022-07-13 13:16:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:25,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091388114] [2022-07-13 13:16:25,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 13:16:25,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091388114] [2022-07-13 13:16:25,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091388114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:25,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:25,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 13:16:25,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630229189] [2022-07-13 13:16:25,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:25,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:25,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:25,813 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:28,125 INFO L93 Difference]: Finished difference Result 1667 states and 3061 transitions. [2022-07-13 13:16:28,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:28,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 13:16:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:28,140 INFO L225 Difference]: With dead ends: 1667 [2022-07-13 13:16:28,141 INFO L226 Difference]: Without dead ends: 998 [2022-07-13 13:16:28,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:28,146 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 521 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:28,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 13:16:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-07-13 13:16:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2022-07-13 13:16:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2022-07-13 13:16:28,238 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 24 [2022-07-13 13:16:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:28,238 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2022-07-13 13:16:28,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2022-07-13 13:16:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 13:16:28,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:28,241 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 13:16:28,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 13:16:28,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1541444623, now seen corresponding path program 1 times [2022-07-13 13:16:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:28,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228894261] [2022-07-13 13:16:28,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:28,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 13:16:28,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:28,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228894261] [2022-07-13 13:16:28,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228894261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:28,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:28,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 13:16:28,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420129828] [2022-07-13 13:16:28,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:28,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:28,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:28,371 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:30,189 INFO L93 Difference]: Finished difference Result 2841 states and 4881 transitions. [2022-07-13 13:16:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:30,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-07-13 13:16:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:30,195 INFO L225 Difference]: With dead ends: 2841 [2022-07-13 13:16:30,195 INFO L226 Difference]: Without dead ends: 1861 [2022-07-13 13:16:30,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:30,198 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:30,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 496 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 13:16:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2022-07-13 13:16:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1857. [2022-07-13 13:16:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.4547413793103448) internal successors, (2700), 1856 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2700 transitions. [2022-07-13 13:16:30,238 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2700 transitions. Word has length 89 [2022-07-13 13:16:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:30,240 INFO L495 AbstractCegarLoop]: Abstraction has 1857 states and 2700 transitions. [2022-07-13 13:16:30,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2700 transitions. [2022-07-13 13:16:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 13:16:30,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:30,248 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 13:16:30,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 13:16:30,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:30,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1536800260, now seen corresponding path program 1 times [2022-07-13 13:16:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:30,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117119819] [2022-07-13 13:16:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 13:16:30,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:30,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117119819] [2022-07-13 13:16:30,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117119819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:30,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:30,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 13:16:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372798135] [2022-07-13 13:16:30,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:30,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:30,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:30,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:30,420 INFO L87 Difference]: Start difference. First operand 1857 states and 2700 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:32,542 INFO L93 Difference]: Finished difference Result 4591 states and 6640 transitions. [2022-07-13 13:16:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:32,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-13 13:16:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:32,550 INFO L225 Difference]: With dead ends: 4591 [2022-07-13 13:16:32,550 INFO L226 Difference]: Without dead ends: 2736 [2022-07-13 13:16:32,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:32,553 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:32,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 537 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 13:16:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2022-07-13 13:16:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2716. [2022-07-13 13:16:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2715 states have (on average 1.390791896869245) internal successors, (3776), 2715 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3776 transitions. [2022-07-13 13:16:32,583 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3776 transitions. Word has length 129 [2022-07-13 13:16:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:32,584 INFO L495 AbstractCegarLoop]: Abstraction has 2716 states and 3776 transitions. [2022-07-13 13:16:32,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3776 transitions. [2022-07-13 13:16:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 13:16:32,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:32,585 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 13:16:32,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 13:16:32,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -54792235, now seen corresponding path program 1 times [2022-07-13 13:16:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:32,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009186682] [2022-07-13 13:16:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 13:16:32,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:32,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009186682] [2022-07-13 13:16:32,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009186682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:32,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:32,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 13:16:32,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511733816] [2022-07-13 13:16:32,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:32,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:32,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:32,695 INFO L87 Difference]: Start difference. First operand 2716 states and 3776 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:34,253 INFO L93 Difference]: Finished difference Result 6709 states and 9429 transitions. [2022-07-13 13:16:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:34,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2022-07-13 13:16:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:34,266 INFO L225 Difference]: With dead ends: 6709 [2022-07-13 13:16:34,266 INFO L226 Difference]: Without dead ends: 3995 [2022-07-13 13:16:34,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:34,270 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:34,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 13:16:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2022-07-13 13:16:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3142. [2022-07-13 13:16:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 3141 states have (on average 1.274434893346068) internal successors, (4003), 3141 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4003 transitions. [2022-07-13 13:16:34,310 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4003 transitions. Word has length 135 [2022-07-13 13:16:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:34,310 INFO L495 AbstractCegarLoop]: Abstraction has 3142 states and 4003 transitions. [2022-07-13 13:16:34,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4003 transitions. [2022-07-13 13:16:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-13 13:16:34,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:34,312 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 13:16:34,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 13:16:34,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2110218527, now seen corresponding path program 1 times [2022-07-13 13:16:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:34,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838922933] [2022-07-13 13:16:34,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 13:16:34,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:34,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838922933] [2022-07-13 13:16:34,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838922933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:34,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:34,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 13:16:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549408756] [2022-07-13 13:16:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:34,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 13:16:34,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:34,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 13:16:34,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 13:16:34,408 INFO L87 Difference]: Start difference. First operand 3142 states and 4003 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:36,558 INFO L93 Difference]: Finished difference Result 8019 states and 10522 transitions. [2022-07-13 13:16:36,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 13:16:36,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-07-13 13:16:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:36,570 INFO L225 Difference]: With dead ends: 8019 [2022-07-13 13:16:36,571 INFO L226 Difference]: Without dead ends: 4879 [2022-07-13 13:16:36,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 13:16:36,576 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 1096 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:36,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 881 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 13:16:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2022-07-13 13:16:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4852. [2022-07-13 13:16:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4851 states have (on average 1.2665429808286952) internal successors, (6144), 4851 states have internal predecessors, (6144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6144 transitions. [2022-07-13 13:16:36,629 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6144 transitions. Word has length 172 [2022-07-13 13:16:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:36,630 INFO L495 AbstractCegarLoop]: Abstraction has 4852 states and 6144 transitions. [2022-07-13 13:16:36,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6144 transitions. [2022-07-13 13:16:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-13 13:16:36,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:36,632 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 13:16:36,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 13:16:36,632 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:36,633 INFO L85 PathProgramCache]: Analyzing trace with hash 435614096, now seen corresponding path program 1 times [2022-07-13 13:16:36,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:36,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577903189] [2022-07-13 13:16:36,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:36,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-13 13:16:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577903189] [2022-07-13 13:16:36,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577903189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:36,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:36,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:16:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144306695] [2022-07-13 13:16:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:36,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:36,712 INFO L87 Difference]: Start difference. First operand 4852 states and 6144 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:38,574 INFO L93 Difference]: Finished difference Result 12249 states and 15825 transitions. [2022-07-13 13:16:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:38,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2022-07-13 13:16:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:38,594 INFO L225 Difference]: With dead ends: 12249 [2022-07-13 13:16:38,594 INFO L226 Difference]: Without dead ends: 7399 [2022-07-13 13:16:38,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:38,603 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 424 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:38,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 545 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 13:16:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7399 states. [2022-07-13 13:16:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7399 to 4826. [2022-07-13 13:16:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2022-07-13 13:16:38,667 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 178 [2022-07-13 13:16:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:38,668 INFO L495 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2022-07-13 13:16:38,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2022-07-13 13:16:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-13 13:16:38,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:38,670 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 13:16:38,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 13:16:38,670 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:38,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:38,671 INFO L85 PathProgramCache]: Analyzing trace with hash 228659428, now seen corresponding path program 1 times [2022-07-13 13:16:38,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:38,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88610848] [2022-07-13 13:16:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 13:16:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:38,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88610848] [2022-07-13 13:16:38,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88610848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:38,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:38,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:16:38,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201988157] [2022-07-13 13:16:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:38,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:38,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:38,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:38,736 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:40,505 INFO L93 Difference]: Finished difference Result 13486 states and 17137 transitions. [2022-07-13 13:16:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2022-07-13 13:16:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:40,523 INFO L225 Difference]: With dead ends: 13486 [2022-07-13 13:16:40,524 INFO L226 Difference]: Without dead ends: 7355 [2022-07-13 13:16:40,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:40,528 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 569 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:40,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 635 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 13:16:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7355 states. [2022-07-13 13:16:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7355 to 6499. [2022-07-13 13:16:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6499 states, 6498 states have (on average 1.1871345029239766) internal successors, (7714), 6498 states have internal predecessors, (7714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 7714 transitions. [2022-07-13 13:16:40,597 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 7714 transitions. Word has length 191 [2022-07-13 13:16:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:40,597 INFO L495 AbstractCegarLoop]: Abstraction has 6499 states and 7714 transitions. [2022-07-13 13:16:40,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 7714 transitions. [2022-07-13 13:16:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-13 13:16:40,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:40,600 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 13:16:40,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 13:16:40,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1285587882, now seen corresponding path program 1 times [2022-07-13 13:16:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:40,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341948593] [2022-07-13 13:16:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 13:16:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:40,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341948593] [2022-07-13 13:16:40,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341948593] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:16:40,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708046237] [2022-07-13 13:16:40,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:40,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:16:40,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:16:40,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 13:16:40,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 13:16:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:40,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 13:16:40,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:16:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 13:16:41,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 13:16:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 13:16:41,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708046237] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 13:16:41,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 13:16:41,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2022-07-13 13:16:41,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907788444] [2022-07-13 13:16:41,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:41,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 13:16:41,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:41,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 13:16:41,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 13:16:41,552 INFO L87 Difference]: Start difference. First operand 6499 states and 7714 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:43,878 INFO L93 Difference]: Finished difference Result 21951 states and 25850 transitions. [2022-07-13 13:16:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 13:16:43,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2022-07-13 13:16:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:43,905 INFO L225 Difference]: With dead ends: 21951 [2022-07-13 13:16:43,905 INFO L226 Difference]: Without dead ends: 15028 [2022-07-13 13:16:43,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 483 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 13:16:43,913 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 903 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 751 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 751 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:43,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 118 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [751 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 13:16:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15028 states. [2022-07-13 13:16:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15028 to 15025. [2022-07-13 13:16:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15025 states, 15024 states have (on average 1.161807774227902) internal successors, (17455), 15024 states have internal predecessors, (17455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15025 states to 15025 states and 17455 transitions. [2022-07-13 13:16:44,077 INFO L78 Accepts]: Start accepts. Automaton has 15025 states and 17455 transitions. Word has length 244 [2022-07-13 13:16:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:44,078 INFO L495 AbstractCegarLoop]: Abstraction has 15025 states and 17455 transitions. [2022-07-13 13:16:44,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 15025 states and 17455 transitions. [2022-07-13 13:16:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-13 13:16:44,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:44,081 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 13:16:44,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 13:16:44,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:16:44,299 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:44,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1945245908, now seen corresponding path program 1 times [2022-07-13 13:16:44,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:44,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956055267] [2022-07-13 13:16:44,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:44,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 13:16:44,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:44,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956055267] [2022-07-13 13:16:44,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956055267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:44,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:44,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:16:44,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403607488] [2022-07-13 13:16:44,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:44,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:44,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:44,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:44,395 INFO L87 Difference]: Start difference. First operand 15025 states and 17455 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:45,792 INFO L93 Difference]: Finished difference Result 34301 states and 39678 transitions. [2022-07-13 13:16:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:45,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2022-07-13 13:16:45,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:45,822 INFO L225 Difference]: With dead ends: 34301 [2022-07-13 13:16:45,822 INFO L226 Difference]: Without dead ends: 18846 [2022-07-13 13:16:45,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:45,838 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 452 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:45,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 316 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 13:16:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18846 states. [2022-07-13 13:16:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18846 to 17143. [2022-07-13 13:16:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17143 states, 17142 states have (on average 1.149399136623498) internal successors, (19703), 17142 states have internal predecessors, (19703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17143 states to 17143 states and 19703 transitions. [2022-07-13 13:16:46,056 INFO L78 Accepts]: Start accepts. Automaton has 17143 states and 19703 transitions. Word has length 262 [2022-07-13 13:16:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:46,056 INFO L495 AbstractCegarLoop]: Abstraction has 17143 states and 19703 transitions. [2022-07-13 13:16:46,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17143 states and 19703 transitions. [2022-07-13 13:16:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-07-13 13:16:46,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:46,060 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 13:16:46,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 13:16:46,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1785165605, now seen corresponding path program 1 times [2022-07-13 13:16:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:46,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005584865] [2022-07-13 13:16:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:46,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-13 13:16:46,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:46,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005584865] [2022-07-13 13:16:46,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005584865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:46,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:46,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:16:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427279029] [2022-07-13 13:16:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:46,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:46,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:46,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:46,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:46,178 INFO L87 Difference]: Start difference. First operand 17143 states and 19703 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:47,754 INFO L93 Difference]: Finished difference Result 37696 states and 43552 transitions. [2022-07-13 13:16:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:47,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2022-07-13 13:16:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:47,780 INFO L225 Difference]: With dead ends: 37696 [2022-07-13 13:16:47,781 INFO L226 Difference]: Without dead ends: 20130 [2022-07-13 13:16:47,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:47,795 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 430 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:47,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 798 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 13:16:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20130 states. [2022-07-13 13:16:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20130 to 20128. [2022-07-13 13:16:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20128 states, 20127 states have (on average 1.1397128235703284) internal successors, (22939), 20127 states have internal predecessors, (22939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20128 states to 20128 states and 22939 transitions. [2022-07-13 13:16:47,984 INFO L78 Accepts]: Start accepts. Automaton has 20128 states and 22939 transitions. Word has length 284 [2022-07-13 13:16:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:47,985 INFO L495 AbstractCegarLoop]: Abstraction has 20128 states and 22939 transitions. [2022-07-13 13:16:47,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 20128 states and 22939 transitions. [2022-07-13 13:16:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2022-07-13 13:16:47,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:47,989 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 13:16:47,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 13:16:47,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash 7470132, now seen corresponding path program 1 times [2022-07-13 13:16:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:47,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633236881] [2022-07-13 13:16:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:47,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-13 13:16:48,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:48,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633236881] [2022-07-13 13:16:48,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633236881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:48,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:48,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:16:48,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033015159] [2022-07-13 13:16:48,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:48,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:48,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:48,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:48,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:48,094 INFO L87 Difference]: Start difference. First operand 20128 states and 22939 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:49,849 INFO L93 Difference]: Finished difference Result 47502 states and 54291 transitions. [2022-07-13 13:16:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:49,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 318 [2022-07-13 13:16:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:49,887 INFO L225 Difference]: With dead ends: 47502 [2022-07-13 13:16:49,887 INFO L226 Difference]: Without dead ends: 27376 [2022-07-13 13:16:49,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:49,902 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 314 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:49,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 780 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 13:16:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27376 states. [2022-07-13 13:16:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27376 to 26088. [2022-07-13 13:16:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26088 states, 26087 states have (on average 1.1315214474642543) internal successors, (29518), 26087 states have internal predecessors, (29518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26088 states to 26088 states and 29518 transitions. [2022-07-13 13:16:50,169 INFO L78 Accepts]: Start accepts. Automaton has 26088 states and 29518 transitions. Word has length 318 [2022-07-13 13:16:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:50,169 INFO L495 AbstractCegarLoop]: Abstraction has 26088 states and 29518 transitions. [2022-07-13 13:16:50,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26088 states and 29518 transitions. [2022-07-13 13:16:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-07-13 13:16:50,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:50,173 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 13:16:50,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 13:16:50,174 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash -3496516, now seen corresponding path program 1 times [2022-07-13 13:16:50,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:50,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086013744] [2022-07-13 13:16:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 204 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 13:16:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086013744] [2022-07-13 13:16:50,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086013744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:16:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007521024] [2022-07-13 13:16:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:16:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:16:50,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 13:16:50,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 13:16:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:50,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 13:16:50,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:16:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 204 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 13:16:50,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 13:16:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 13:16:50,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007521024] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 13:16:50,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 13:16:50,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2022-07-13 13:16:50,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237438475] [2022-07-13 13:16:50,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:50,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 13:16:50,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:50,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 13:16:50,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 13:16:50,890 INFO L87 Difference]: Start difference. First operand 26088 states and 29518 transitions. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:53,443 INFO L93 Difference]: Finished difference Result 64952 states and 74037 transitions. [2022-07-13 13:16:53,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 13:16:53,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2022-07-13 13:16:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:53,537 INFO L225 Difference]: With dead ends: 64952 [2022-07-13 13:16:53,537 INFO L226 Difference]: Without dead ends: 38441 [2022-07-13 13:16:53,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 641 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 13:16:53,546 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 857 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:53,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 183 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 2202 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 13:16:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38441 states. [2022-07-13 13:16:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38441 to 34602. [2022-07-13 13:16:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34602 states, 34601 states have (on average 1.1374237738793676) internal successors, (39356), 34601 states have internal predecessors, (39356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34602 states to 34602 states and 39356 transitions. [2022-07-13 13:16:53,875 INFO L78 Accepts]: Start accepts. Automaton has 34602 states and 39356 transitions. Word has length 323 [2022-07-13 13:16:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:53,875 INFO L495 AbstractCegarLoop]: Abstraction has 34602 states and 39356 transitions. [2022-07-13 13:16:53,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 34602 states and 39356 transitions. [2022-07-13 13:16:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2022-07-13 13:16:53,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:53,882 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 13:16:53,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 13:16:54,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 13:16:54,092 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:54,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:54,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1925054524, now seen corresponding path program 1 times [2022-07-13 13:16:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:54,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088788354] [2022-07-13 13:16:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-07-13 13:16:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:54,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088788354] [2022-07-13 13:16:54,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088788354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:54,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:54,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:16:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170039016] [2022-07-13 13:16:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:54,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:54,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:54,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:54,228 INFO L87 Difference]: Start difference. First operand 34602 states and 39356 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:55,991 INFO L93 Difference]: Finished difference Result 87945 states and 99521 transitions. [2022-07-13 13:16:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 448 [2022-07-13 13:16:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:56,057 INFO L225 Difference]: With dead ends: 87945 [2022-07-13 13:16:56,057 INFO L226 Difference]: Without dead ends: 53345 [2022-07-13 13:16:56,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:56,083 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 361 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:56,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 259 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 13:16:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53345 states. [2022-07-13 13:16:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53345 to 50767. [2022-07-13 13:16:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50767 states, 50766 states have (on average 1.121892605287003) internal successors, (56954), 50766 states have internal predecessors, (56954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50767 states to 50767 states and 56954 transitions. [2022-07-13 13:16:56,687 INFO L78 Accepts]: Start accepts. Automaton has 50767 states and 56954 transitions. Word has length 448 [2022-07-13 13:16:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:56,687 INFO L495 AbstractCegarLoop]: Abstraction has 50767 states and 56954 transitions. [2022-07-13 13:16:56,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 50767 states and 56954 transitions. [2022-07-13 13:16:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2022-07-13 13:16:56,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:56,696 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2022-07-13 13:16:56,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 13:16:56,697 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash 548959328, now seen corresponding path program 1 times [2022-07-13 13:16:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:56,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15418920] [2022-07-13 13:16:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-13 13:16:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:56,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15418920] [2022-07-13 13:16:56,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15418920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:56,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:56,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:16:56,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862439507] [2022-07-13 13:16:56,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:56,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:16:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:56,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:16:56,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:56,828 INFO L87 Difference]: Start difference. First operand 50767 states and 56954 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:16:58,460 INFO L93 Difference]: Finished difference Result 116044 states and 130400 transitions. [2022-07-13 13:16:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:16:58,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 455 [2022-07-13 13:16:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:16:58,530 INFO L225 Difference]: With dead ends: 116044 [2022-07-13 13:16:58,530 INFO L226 Difference]: Without dead ends: 65279 [2022-07-13 13:16:58,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:16:58,558 INFO L413 NwaCegarLoop]: 724 mSDtfsCounter, 366 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 13:16:58,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 782 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 13:16:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65279 states. [2022-07-13 13:16:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65279 to 65269. [2022-07-13 13:16:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65269 states, 65268 states have (on average 1.1070202855917142) internal successors, (72253), 65268 states have internal predecessors, (72253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65269 states to 65269 states and 72253 transitions. [2022-07-13 13:16:59,352 INFO L78 Accepts]: Start accepts. Automaton has 65269 states and 72253 transitions. Word has length 455 [2022-07-13 13:16:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:16:59,353 INFO L495 AbstractCegarLoop]: Abstraction has 65269 states and 72253 transitions. [2022-07-13 13:16:59,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:16:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 65269 states and 72253 transitions. [2022-07-13 13:16:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2022-07-13 13:16:59,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:16:59,361 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2022-07-13 13:16:59,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 13:16:59,362 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:16:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:16:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash 805436069, now seen corresponding path program 1 times [2022-07-13 13:16:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:16:59,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377173573] [2022-07-13 13:16:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:16:59,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:16:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:16:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 13:16:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:16:59,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377173573] [2022-07-13 13:16:59,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377173573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:16:59,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:16:59,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 13:16:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076474861] [2022-07-13 13:16:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:16:59,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 13:16:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:16:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 13:16:59,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 13:16:59,672 INFO L87 Difference]: Start difference. First operand 65269 states and 72253 transitions. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:17:02,199 INFO L93 Difference]: Finished difference Result 151864 states and 168111 transitions. [2022-07-13 13:17:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 13:17:02,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 457 [2022-07-13 13:17:02,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:17:02,293 INFO L225 Difference]: With dead ends: 151864 [2022-07-13 13:17:02,293 INFO L226 Difference]: Without dead ends: 86597 [2022-07-13 13:17:02,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 13:17:02,323 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 780 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 13:17:02,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 197 Invalid, 2665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 13:17:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86597 states. [2022-07-13 13:17:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86597 to 83611. [2022-07-13 13:17:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83611 states, 83610 states have (on average 1.1066858031335964) internal successors, (92530), 83610 states have internal predecessors, (92530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83611 states to 83611 states and 92530 transitions. [2022-07-13 13:17:03,275 INFO L78 Accepts]: Start accepts. Automaton has 83611 states and 92530 transitions. Word has length 457 [2022-07-13 13:17:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:17:03,276 INFO L495 AbstractCegarLoop]: Abstraction has 83611 states and 92530 transitions. [2022-07-13 13:17:03,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 83611 states and 92530 transitions. [2022-07-13 13:17:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-07-13 13:17:03,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:17:03,285 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-07-13 13:17:03,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 13:17:03,285 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:17:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:17:03,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1873954327, now seen corresponding path program 1 times [2022-07-13 13:17:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:17:03,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084507006] [2022-07-13 13:17:03,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:17:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:17:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:17:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 440 proven. 82 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-13 13:17:03,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:17:03,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084507006] [2022-07-13 13:17:03,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084507006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:17:03,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740593857] [2022-07-13 13:17:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:17:03,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:17:03,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:17:03,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 13:17:03,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 13:17:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:17:03,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 13:17:03,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:17:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-13 13:17:04,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 13:17:04,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740593857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:17:04,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 13:17:04,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-13 13:17:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478215872] [2022-07-13 13:17:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:17:04,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:17:04,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:17:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:17:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 13:17:04,035 INFO L87 Difference]: Start difference. First operand 83611 states and 92530 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:17:06,091 INFO L93 Difference]: Finished difference Result 174035 states and 192465 transitions. [2022-07-13 13:17:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:17:06,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2022-07-13 13:17:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:17:06,181 INFO L225 Difference]: With dead ends: 174035 [2022-07-13 13:17:06,181 INFO L226 Difference]: Without dead ends: 90426 [2022-07-13 13:17:06,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 13:17:06,205 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 348 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 13:17:06,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 750 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 13:17:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90426 states. [2022-07-13 13:17:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90426 to 87015. [2022-07-13 13:17:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87015 states, 87014 states have (on average 1.1051784770266853) internal successors, (96166), 87014 states have internal predecessors, (96166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87015 states to 87015 states and 96166 transitions. [2022-07-13 13:17:07,113 INFO L78 Accepts]: Start accepts. Automaton has 87015 states and 96166 transitions. Word has length 477 [2022-07-13 13:17:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:17:07,114 INFO L495 AbstractCegarLoop]: Abstraction has 87015 states and 96166 transitions. [2022-07-13 13:17:07,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 87015 states and 96166 transitions. [2022-07-13 13:17:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2022-07-13 13:17:07,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:17:07,123 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-13 13:17:07,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 13:17:07,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:17:07,332 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:17:07,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:17:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1202721119, now seen corresponding path program 1 times [2022-07-13 13:17:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:17:07,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15251926] [2022-07-13 13:17:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:17:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:17:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:17:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-13 13:17:07,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:17:07,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15251926] [2022-07-13 13:17:07,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15251926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:17:07,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:17:07,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:17:07,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039493628] [2022-07-13 13:17:07,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:17:07,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:17:07,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:17:07,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:17:07,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:17:07,465 INFO L87 Difference]: Start difference. First operand 87015 states and 96166 transitions. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:17:09,596 INFO L93 Difference]: Finished difference Result 182568 states and 201475 transitions. [2022-07-13 13:17:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:17:09,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 500 [2022-07-13 13:17:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:17:09,699 INFO L225 Difference]: With dead ends: 182568 [2022-07-13 13:17:09,699 INFO L226 Difference]: Without dead ends: 95555 [2022-07-13 13:17:09,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:17:09,743 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 407 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 13:17:09,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 202 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 13:17:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95555 states. [2022-07-13 13:17:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95555 to 85740. [2022-07-13 13:17:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85740 states, 85739 states have (on average 1.1051213566754918) internal successors, (94752), 85739 states have internal predecessors, (94752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85740 states to 85740 states and 94752 transitions. [2022-07-13 13:17:10,748 INFO L78 Accepts]: Start accepts. Automaton has 85740 states and 94752 transitions. Word has length 500 [2022-07-13 13:17:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:17:10,748 INFO L495 AbstractCegarLoop]: Abstraction has 85740 states and 94752 transitions. [2022-07-13 13:17:10,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 85740 states and 94752 transitions. [2022-07-13 13:17:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2022-07-13 13:17:10,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:17:10,759 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 13:17:10,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 13:17:10,759 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:17:10,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:17:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1003607398, now seen corresponding path program 1 times [2022-07-13 13:17:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:17:10,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654786606] [2022-07-13 13:17:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:17:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:17:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:17:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 485 proven. 82 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-13 13:17:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:17:10,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654786606] [2022-07-13 13:17:10,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654786606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:17:10,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286968276] [2022-07-13 13:17:10,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:17:10,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:17:10,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:17:10,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 13:17:10,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 13:17:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:17:11,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 13:17:11,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:17:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-13 13:17:11,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 13:17:11,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286968276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:17:11,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 13:17:11,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2022-07-13 13:17:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799722247] [2022-07-13 13:17:11,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:17:11,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 13:17:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:17:11,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 13:17:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 13:17:11,773 INFO L87 Difference]: Start difference. First operand 85740 states and 94752 transitions. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:17:14,842 INFO L93 Difference]: Finished difference Result 194935 states and 215467 transitions. [2022-07-13 13:17:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 13:17:14,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 535 [2022-07-13 13:17:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:17:14,974 INFO L225 Difference]: With dead ends: 194935 [2022-07-13 13:17:14,974 INFO L226 Difference]: Without dead ends: 109197 [2022-07-13 13:17:15,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 13:17:15,024 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 791 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 13:17:15,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 299 Invalid, 3193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 13:17:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109197 states. [2022-07-13 13:17:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109197 to 92538. [2022-07-13 13:17:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92538 states, 92537 states have (on average 1.095929195889212) internal successors, (101414), 92537 states have internal predecessors, (101414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92538 states to 92538 states and 101414 transitions. [2022-07-13 13:17:16,240 INFO L78 Accepts]: Start accepts. Automaton has 92538 states and 101414 transitions. Word has length 535 [2022-07-13 13:17:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:17:16,240 INFO L495 AbstractCegarLoop]: Abstraction has 92538 states and 101414 transitions. [2022-07-13 13:17:16,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:17:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 92538 states and 101414 transitions. [2022-07-13 13:17:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2022-07-13 13:17:16,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:17:16,250 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 13:17:16,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 13:17:16,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 13:17:16,451 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:17:16,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:17:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1617026919, now seen corresponding path program 1 times [2022-07-13 13:17:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:17:16,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070441276] [2022-07-13 13:17:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:17:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:17:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 13:17:16,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 13:17:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 13:17:16,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 13:17:16,932 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 13:17:16,934 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 13:17:16,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 13:17:16,937 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 13:17:16,942 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 13:17:17,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 01:17:17 BoogieIcfgContainer [2022-07-13 13:17:17,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 13:17:17,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 13:17:17,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 13:17:17,096 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 13:17:17,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:16:25" (3/4) ... [2022-07-13 13:17:17,097 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 13:17:17,231 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 13:17:17,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 13:17:17,232 INFO L158 Benchmark]: Toolchain (without parser) took 55278.23ms. Allocated memory was 96.5MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 60.8MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-07-13 13:17:17,232 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 13:17:17,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.40ms. Allocated memory was 96.5MB in the beginning and 130.0MB in the end (delta: 33.6MB). Free memory was 60.8MB in the beginning and 74.6MB in the end (delta: -13.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-07-13 13:17:17,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 269.50ms. Allocated memory was 130.0MB in the beginning and 199.2MB in the end (delta: 69.2MB). Free memory was 73.9MB in the beginning and 121.1MB in the end (delta: -47.3MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2022-07-13 13:17:17,233 INFO L158 Benchmark]: Boogie Preprocessor took 207.40ms. Allocated memory is still 199.2MB. Free memory was 121.1MB in the beginning and 91.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-13 13:17:17,233 INFO L158 Benchmark]: RCFGBuilder took 2287.86ms. Allocated memory was 199.2MB in the beginning and 318.8MB in the end (delta: 119.5MB). Free memory was 91.8MB in the beginning and 134.5MB in the end (delta: -42.7MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2022-07-13 13:17:17,234 INFO L158 Benchmark]: TraceAbstraction took 51595.45ms. Allocated memory was 318.8MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 133.4MB in the beginning and 6.2GB in the end (delta: -6.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-07-13 13:17:17,234 INFO L158 Benchmark]: Witness Printer took 136.06ms. Allocated memory is still 7.8GB. Free memory was 6.2GB in the beginning and 6.1GB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-13 13:17:17,237 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.40ms. Allocated memory was 96.5MB in the beginning and 130.0MB in the end (delta: 33.6MB). Free memory was 60.8MB in the beginning and 74.6MB in the end (delta: -13.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 269.50ms. Allocated memory was 130.0MB in the beginning and 199.2MB in the end (delta: 69.2MB). Free memory was 73.9MB in the beginning and 121.1MB in the end (delta: -47.3MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 207.40ms. Allocated memory is still 199.2MB. Free memory was 121.1MB in the beginning and 91.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2287.86ms. Allocated memory was 199.2MB in the beginning and 318.8MB in the end (delta: 119.5MB). Free memory was 91.8MB in the beginning and 134.5MB in the end (delta: -42.7MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. * TraceAbstraction took 51595.45ms. Allocated memory was 318.8MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 133.4MB in the beginning and 6.2GB in the end (delta: -6.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 136.06ms. Allocated memory is still 7.8GB. Free memory was 6.2GB in the beginning and 6.1GB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 90]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int inputA = 1; [L19] int inputB = 2; [L20] int inputC = 3; [L21] int inputE = 5; [L22] int inputD = 4; [L23] int inputF = 6; [L26] int a24 = 1; [L27] int a21 = 124; [L28] int a26 = 222; [L29] int a14 = -79; [L30] int a28 = 111; VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2587] int output = -1; VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND TRUE ( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 )) [L334] a14 = ((((a14 % 299909)- 300090) + 0) + -1) [L335] a26 = ((((a26 * 9)/ 10) - 554854) * 1) [L336] a28 = ((((a28 * 9)/ 10) * 1) - 589002) [L337] a24 = 2 [L339] return 25; VAL [\old(input)=6, \result=25, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND TRUE ( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 )) [L330] a14 = (((((a14 * 9)/ 10) + -48560) % 14)+ -98) [L331] a28 = ((((a28 - 0) + 0) % 82)+ 217) [L332] return 25; VAL [\old(input)=6, \result=25, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [\old(input)=4, a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND TRUE ((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 )) [L469] a14 = (((a14 / 5) - 46740) - -32098) [L470] a26 = ((((a26 - 0) % 46)- -199) + -16) [L471] a28 = ((((a28 * 9)/ 10) + -35946) + -1966) [L472] return 25; VAL [\old(input)=4, \result=25, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [\old(input)=5, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND TRUE (((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 ) [L497] a26 = (((a26 + -496055) - -804201) / 5) [L498] a28 = ((((a28 / 5) / 5) % 48)- -86) [L499] return 21; VAL [\old(input)=5, \result=21, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L609] COND FALSE !((((((a24==2) && ( ((134 < a28) && (300 >= a28)) && (input == 2))) && 217 < a26 ) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !(( a28 <= 37 && (( 217 < a26 && ((a24==3) && ((input == 3) && a14 <= -182 ))) && a21 <= 127 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(( a21 <= 127 && (((a24==3) && (((input == 4) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 )) && a26 <= -68 ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ( a14 <= -182 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))) && (a24==2))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6)) && a14 <= -182 ))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L650] COND FALSE !(((((((a24==3) && (input == 5)) && 217 < a26 ) && a28 <= 37 ) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 2)) && (a24==3))) && ((-68 < a26) && (124 >= a26)) ) && a14 <= -182 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(( 217 < a26 && (((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 4)) && a21 <= 127 ) && (a24==2)) && ((-114 < a14) && (-84 >= a14)) ))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((((a24==3) && ( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2))))) && a21 <= 127 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L677] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 5))) && a26 <= -68 ) && a21 <= 127 ) && (a24==2))) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L683] COND FALSE !(((((a24==2) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5))) && a21 <= 127 ) && a26 <= -68 )) VAL [\old(input)=3, a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L689] COND TRUE ( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && ((( 217 < a26 && (input == 3)) && a14 <= -182 ) && (a24==2)))) [L690] a14 = (((a14 / -5) + 209000) + 129249) [L691] a26 = (((((a26 - 390752) - -126915) / 5) % 95)+ 29) [L692] a28 = (((a28 - -390078) * 1) + 42716) [L693] a24 = 1 [L695] return -1; VAL [\old(input)=3, \result=-1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND TRUE (((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 ) VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] reach_error() VAL [\old(input)=1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.4s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 37.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9725 SdHoareTripleChecker+Valid, 32.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9725 mSDsluCounter, 8645 SdHoareTripleChecker+Invalid, 26.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1143 mSDsCounter, 6249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27973 IncrementalHoareTripleChecker+Invalid, 34222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6249 mSolverCounterUnsat, 7502 mSDtfsCounter, 27973 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2197 GetRequests, 2158 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92538occurred in iteration=18, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 46643 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 7337 NumberOfCodeBlocks, 7337 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 7343 ConstructedInterpolants, 0 QuantifiedInterpolants, 22559 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2161 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 7360/7844 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 13:17:17,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE