./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem17_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem17_label16.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --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 12946011ae947529b791d0ea774eddb13cd60d584cd7e2008a422f41653953d6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 08:18:07,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 08:18:07,710 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 08:18:07,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 08:18:07,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 08:18:07,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 08:18:07,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 08:18:07,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 08:18:07,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 08:18:07,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 08:18:07,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 08:18:07,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 08:18:07,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 08:18:07,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 08:18:07,737 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 08:18:07,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 08:18:07,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 08:18:07,737 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 08:18:07,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 08:18:07,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 08:18:07,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 08:18:07,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 08:18:07,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 08:18:07,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 08:18:07,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 08:18:07,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 08:18:07,738 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 08:18:07,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 08:18:07,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 08:18:07,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:18:07,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:18:07,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:18:07,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:18:07,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 08:18:07,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:18:07,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:18:07,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:18:07,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:18:07,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 08:18:07,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 08:18:07,739 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 08:18:07,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 08:18:07,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 08:18:07,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 08:18:07,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 08:18:07,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 08:18:07,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 08:18:07,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 08:18:07,740 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 12946011ae947529b791d0ea774eddb13cd60d584cd7e2008a422f41653953d6 [2024-12-02 08:18:07,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 08:18:07,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 08:18:07,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 08:18:07,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 08:18:07,953 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 08:18:07,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/eca-rers2012/Problem17_label16.c [2024-12-02 08:18:10,579 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/data/85851ce1c/523364d0fbc2444c8fa7b234efc381c7/FLAG35465edf2 [2024-12-02 08:18:10,928 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 08:18:10,928 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/sv-benchmarks/c/eca-rers2012/Problem17_label16.c [2024-12-02 08:18:10,946 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/data/85851ce1c/523364d0fbc2444c8fa7b234efc381c7/FLAG35465edf2 [2024-12-02 08:18:10,959 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/data/85851ce1c/523364d0fbc2444c8fa7b234efc381c7 [2024-12-02 08:18:10,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 08:18:10,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 08:18:10,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 08:18:10,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 08:18:10,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 08:18:10,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:18:10" (1/1) ... [2024-12-02 08:18:10,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7726c411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:10, skipping insertion in model container [2024-12-02 08:18:10,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:18:10" (1/1) ... [2024-12-02 08:18:11,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 08:18:11,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/sv-benchmarks/c/eca-rers2012/Problem17_label16.c[3929,3942] [2024-12-02 08:18:11,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:18:11,581 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 08:18:11,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/sv-benchmarks/c/eca-rers2012/Problem17_label16.c[3929,3942] [2024-12-02 08:18:11,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:18:11,820 INFO L204 MainTranslator]: Completed translation [2024-12-02 08:18:11,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11 WrapperNode [2024-12-02 08:18:11,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 08:18:11,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 08:18:11,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 08:18:11,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 08:18:11,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:11,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,087 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2612 [2024-12-02 08:18:12,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 08:18:12,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 08:18:12,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 08:18:12,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 08:18:12,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 08:18:12,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 08:18:12,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 08:18:12,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 08:18:12,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 08:18:12,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (1/1) ... [2024-12-02 08:18:12,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:18:12,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:18:12,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 08:18:12,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 08:18:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 08:18:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 08:18:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 08:18:12,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 08:18:12,518 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 08:18:12,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 08:18:15,829 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-12-02 08:18:15,829 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 08:18:15,852 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 08:18:15,853 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 08:18:15,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:15 BoogieIcfgContainer [2024-12-02 08:18:15,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 08:18:15,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 08:18:15,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 08:18:15,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 08:18:15,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:18:10" (1/3) ... [2024-12-02 08:18:15,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd7e64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:18:15, skipping insertion in model container [2024-12-02 08:18:15,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:11" (2/3) ... [2024-12-02 08:18:15,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd7e64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:18:15, skipping insertion in model container [2024-12-02 08:18:15,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:15" (3/3) ... [2024-12-02 08:18:15,864 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label16.c [2024-12-02 08:18:15,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 08:18:15,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label16.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 08:18:15,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 08:18:15,962 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ff4c729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 08:18:15,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 08:18:15,969 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) [2024-12-02 08:18:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-02 08:18:15,974 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:15,975 INFO L218 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, 1] [2024-12-02 08:18:15,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1225036359, now seen corresponding path program 1 times [2024-12-02 08:18:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:15,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851022001] [2024-12-02 08:18:15,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:18:16,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:16,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851022001] [2024-12-02 08:18:16,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851022001] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:16,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:16,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:18:16,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216989913] [2024-12-02 08:18:16,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:16,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:16,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:16,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:16,231 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.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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) [2024-12-02 08:18:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:18,687 INFO L93 Difference]: Finished difference Result 1644 states and 3029 transitions. [2024-12-02 08:18:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:18,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 25 [2024-12-02 08:18:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:18,702 INFO L225 Difference]: With dead ends: 1644 [2024-12-02 08:18:18,702 INFO L226 Difference]: Without dead ends: 977 [2024-12-02 08:18:18,705 INFO L434 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 [2024-12-02 08:18:18,708 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 463 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:18,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 08:18:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-12-02 08:18:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-12-02 08:18:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 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) [2024-12-02 08:18:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2024-12-02 08:18:18,778 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 25 [2024-12-02 08:18:18,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:18,779 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2024-12-02 08:18:18,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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) [2024-12-02 08:18:18,779 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2024-12-02 08:18:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-02 08:18:18,781 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:18,781 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 08:18:18,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 08:18:18,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:18,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1947080830, now seen corresponding path program 1 times [2024-12-02 08:18:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:18,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561819834] [2024-12-02 08:18:18,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:18,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:18:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561819834] [2024-12-02 08:18:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561819834] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:18,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:18:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785451718] [2024-12-02 08:18:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:18,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:18,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:18,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:18,988 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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) [2024-12-02 08:18:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:21,094 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2024-12-02 08:18:21,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:21,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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 92 [2024-12-02 08:18:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:21,099 INFO L225 Difference]: With dead ends: 2813 [2024-12-02 08:18:21,099 INFO L226 Difference]: Without dead ends: 1844 [2024-12-02 08:18:21,100 INFO L434 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 [2024-12-02 08:18:21,101 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:21,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-02 08:18:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-12-02 08:18:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2024-12-02 08:18:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 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) [2024-12-02 08:18:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2024-12-02 08:18:21,131 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 92 [2024-12-02 08:18:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:21,131 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2024-12-02 08:18:21,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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) [2024-12-02 08:18:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2024-12-02 08:18:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-02 08:18:21,133 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:21,133 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 08:18:21,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 08:18:21,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:21,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1701944076, now seen corresponding path program 1 times [2024-12-02 08:18:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:21,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69904764] [2024-12-02 08:18:21,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:18:21,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:21,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69904764] [2024-12-02 08:18:21,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69904764] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:21,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:21,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:18:21,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475350960] [2024-12-02 08:18:21,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:21,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:18:21,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:21,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:18:21,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:18:21,373 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 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) [2024-12-02 08:18:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:24,978 INFO L93 Difference]: Finished difference Result 6767 states and 9259 transitions. [2024-12-02 08:18:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:18:24,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-12-02 08:18:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:24,996 INFO L225 Difference]: With dead ends: 6767 [2024-12-02 08:18:24,996 INFO L226 Difference]: Without dead ends: 4928 [2024-12-02 08:18:24,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:18:25,000 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 889 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:25,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 328 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 08:18:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2024-12-02 08:18:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4875. [2024-12-02 08:18:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.2866228970045137) internal successors, (6271), 4874 states have internal predecessors, (6271), 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) [2024-12-02 08:18:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6271 transitions. [2024-12-02 08:18:25,101 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6271 transitions. Word has length 95 [2024-12-02 08:18:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:25,102 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6271 transitions. [2024-12-02 08:18:25,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 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) [2024-12-02 08:18:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6271 transitions. [2024-12-02 08:18:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-12-02 08:18:25,105 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:25,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:25,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 08:18:25,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash -106790988, now seen corresponding path program 1 times [2024-12-02 08:18:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260456955] [2024-12-02 08:18:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-02 08:18:25,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:25,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260456955] [2024-12-02 08:18:25,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260456955] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:25,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:25,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:18:25,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122138064] [2024-12-02 08:18:25,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:25,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:25,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:25,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:25,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:25,361 INFO L87 Difference]: Start difference. First operand 4875 states and 6271 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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) [2024-12-02 08:18:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:27,236 INFO L93 Difference]: Finished difference Result 14436 states and 18544 transitions. [2024-12-02 08:18:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 164 [2024-12-02 08:18:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:27,254 INFO L225 Difference]: With dead ends: 14436 [2024-12-02 08:18:27,254 INFO L226 Difference]: Without dead ends: 8277 [2024-12-02 08:18:27,259 INFO L434 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 [2024-12-02 08:18:27,259 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 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.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:27,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-12-02 08:18:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2024-12-02 08:18:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6576. [2024-12-02 08:18:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6575 states have (on average 1.1793155893536122) internal successors, (7754), 6575 states have internal predecessors, (7754), 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) [2024-12-02 08:18:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 7754 transitions. [2024-12-02 08:18:27,349 INFO L78 Accepts]: Start accepts. Automaton has 6576 states and 7754 transitions. Word has length 164 [2024-12-02 08:18:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:27,350 INFO L471 AbstractCegarLoop]: Abstraction has 6576 states and 7754 transitions. [2024-12-02 08:18:27,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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) [2024-12-02 08:18:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6576 states and 7754 transitions. [2024-12-02 08:18:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-02 08:18:27,352 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:27,352 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 08:18:27,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:27,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:27,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1141369514, now seen corresponding path program 1 times [2024-12-02 08:18:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064143549] [2024-12-02 08:18:27,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:18:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:27,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064143549] [2024-12-02 08:18:27,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064143549] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:27,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:27,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:18:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749439030] [2024-12-02 08:18:27,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:27,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:27,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:27,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:27,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:27,558 INFO L87 Difference]: Start difference. First operand 6576 states and 7754 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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) [2024-12-02 08:18:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:29,612 INFO L93 Difference]: Finished difference Result 16560 states and 19931 transitions. [2024-12-02 08:18:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:29,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 177 [2024-12-02 08:18:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:29,633 INFO L225 Difference]: With dead ends: 16560 [2024-12-02 08:18:29,633 INFO L226 Difference]: Without dead ends: 9986 [2024-12-02 08:18:29,638 INFO L434 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 [2024-12-02 08:18:29,639 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:29,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 801 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-02 08:18:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2024-12-02 08:18:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9986. [2024-12-02 08:18:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9986 states, 9985 states have (on average 1.1696544817225838) internal successors, (11679), 9985 states have internal predecessors, (11679), 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) [2024-12-02 08:18:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9986 states to 9986 states and 11679 transitions. [2024-12-02 08:18:29,795 INFO L78 Accepts]: Start accepts. Automaton has 9986 states and 11679 transitions. Word has length 177 [2024-12-02 08:18:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:29,796 INFO L471 AbstractCegarLoop]: Abstraction has 9986 states and 11679 transitions. [2024-12-02 08:18:29,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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) [2024-12-02 08:18:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 9986 states and 11679 transitions. [2024-12-02 08:18:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-02 08:18:29,798 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:29,798 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:29,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 08:18:29,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:29,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash 3113787, now seen corresponding path program 1 times [2024-12-02 08:18:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470682839] [2024-12-02 08:18:29,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-02 08:18:29,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:29,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470682839] [2024-12-02 08:18:29,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470682839] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:29,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:29,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:18:29,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24919485] [2024-12-02 08:18:29,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:29,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:29,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:29,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:29,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:29,980 INFO L87 Difference]: Start difference. First operand 9986 states and 11679 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) [2024-12-02 08:18:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:31,943 INFO L93 Difference]: Finished difference Result 25067 states and 29587 transitions. [2024-12-02 08:18:31,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:31,944 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 179 [2024-12-02 08:18:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:31,965 INFO L225 Difference]: With dead ends: 25067 [2024-12-02 08:18:31,965 INFO L226 Difference]: Without dead ends: 15083 [2024-12-02 08:18:31,971 INFO L434 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 [2024-12-02 08:18:31,972 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 429 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:31,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 486 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 08:18:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15083 states. [2024-12-02 08:18:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15083 to 10384. [2024-12-02 08:18:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10384 states, 10383 states have (on average 1.1651738418568813) internal successors, (12098), 10383 states have internal predecessors, (12098), 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) [2024-12-02 08:18:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 12098 transitions. [2024-12-02 08:18:32,090 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 12098 transitions. Word has length 179 [2024-12-02 08:18:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:32,091 INFO L471 AbstractCegarLoop]: Abstraction has 10384 states and 12098 transitions. [2024-12-02 08:18:32,091 INFO L472 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) [2024-12-02 08:18:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 12098 transitions. [2024-12-02 08:18:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-02 08:18:32,093 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:32,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:32,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 08:18:32,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:32,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1690682791, now seen corresponding path program 1 times [2024-12-02 08:18:32,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24937901] [2024-12-02 08:18:32,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-02 08:18:32,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:32,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24937901] [2024-12-02 08:18:32,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24937901] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:32,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:18:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164279895] [2024-12-02 08:18:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:32,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:32,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:32,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:32,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:32,261 INFO L87 Difference]: Start difference. First operand 10384 states and 12098 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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) [2024-12-02 08:18:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:34,339 INFO L93 Difference]: Finished difference Result 25874 states and 30417 transitions. [2024-12-02 08:18:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:34,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 192 [2024-12-02 08:18:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:34,359 INFO L225 Difference]: With dead ends: 25874 [2024-12-02 08:18:34,359 INFO L226 Difference]: Without dead ends: 15492 [2024-12-02 08:18:34,365 INFO L434 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 [2024-12-02 08:18:34,366 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 453 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:34,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 448 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-02 08:18:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2024-12-02 08:18:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 13778. [2024-12-02 08:18:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 13777 states have (on average 1.166509399724178) internal successors, (16071), 13777 states have internal predecessors, (16071), 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) [2024-12-02 08:18:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 16071 transitions. [2024-12-02 08:18:34,480 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 16071 transitions. Word has length 192 [2024-12-02 08:18:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:34,480 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 16071 transitions. [2024-12-02 08:18:34,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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) [2024-12-02 08:18:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 16071 transitions. [2024-12-02 08:18:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-02 08:18:34,483 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:34,484 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:34,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 08:18:34,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:34,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1691584357, now seen corresponding path program 1 times [2024-12-02 08:18:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:34,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425507422] [2024-12-02 08:18:34,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:34,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-02 08:18:34,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:34,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425507422] [2024-12-02 08:18:34,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425507422] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:34,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:34,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:18:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395759829] [2024-12-02 08:18:34,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:34,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:34,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:34,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:34,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:34,612 INFO L87 Difference]: Start difference. First operand 13778 states and 16071 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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) [2024-12-02 08:18:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:36,645 INFO L93 Difference]: Finished difference Result 32234 states and 37932 transitions. [2024-12-02 08:18:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:36,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 224 [2024-12-02 08:18:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:36,671 INFO L225 Difference]: With dead ends: 32234 [2024-12-02 08:18:36,671 INFO L226 Difference]: Without dead ends: 18458 [2024-12-02 08:18:36,682 INFO L434 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 [2024-12-02 08:18:36,682 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 467 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:36,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 416 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 08:18:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18458 states. [2024-12-02 08:18:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18458 to 17176. [2024-12-02 08:18:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17176 states, 17175 states have (on average 1.1833478893740903) internal successors, (20324), 17175 states have internal predecessors, (20324), 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) [2024-12-02 08:18:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17176 states to 17176 states and 20324 transitions. [2024-12-02 08:18:36,921 INFO L78 Accepts]: Start accepts. Automaton has 17176 states and 20324 transitions. Word has length 224 [2024-12-02 08:18:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:36,922 INFO L471 AbstractCegarLoop]: Abstraction has 17176 states and 20324 transitions. [2024-12-02 08:18:36,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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) [2024-12-02 08:18:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 17176 states and 20324 transitions. [2024-12-02 08:18:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-02 08:18:36,924 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:36,924 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:36,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 08:18:36,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:36,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash 852276715, now seen corresponding path program 1 times [2024-12-02 08:18:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831056015] [2024-12-02 08:18:36,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:18:37,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:37,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831056015] [2024-12-02 08:18:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831056015] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:37,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:37,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:18:37,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723112619] [2024-12-02 08:18:37,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:37,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:37,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:37,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:37,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:37,313 INFO L87 Difference]: Start difference. First operand 17176 states and 20324 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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) [2024-12-02 08:18:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:39,288 INFO L93 Difference]: Finished difference Result 39057 states and 46415 transitions. [2024-12-02 08:18:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:39,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 241 [2024-12-02 08:18:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:39,310 INFO L225 Difference]: With dead ends: 39057 [2024-12-02 08:18:39,310 INFO L226 Difference]: Without dead ends: 21458 [2024-12-02 08:18:39,323 INFO L434 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 [2024-12-02 08:18:39,323 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 356 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:39,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 864 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 08:18:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21458 states. [2024-12-02 08:18:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21458 to 21025. [2024-12-02 08:18:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21025 states, 21024 states have (on average 1.1667142313546424) internal successors, (24529), 21024 states have internal predecessors, (24529), 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) [2024-12-02 08:18:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21025 states to 21025 states and 24529 transitions. [2024-12-02 08:18:39,554 INFO L78 Accepts]: Start accepts. Automaton has 21025 states and 24529 transitions. Word has length 241 [2024-12-02 08:18:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:39,554 INFO L471 AbstractCegarLoop]: Abstraction has 21025 states and 24529 transitions. [2024-12-02 08:18:39,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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) [2024-12-02 08:18:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 21025 states and 24529 transitions. [2024-12-02 08:18:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-12-02 08:18:39,555 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:39,555 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:39,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 08:18:39,556 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:39,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1233843982, now seen corresponding path program 1 times [2024-12-02 08:18:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:39,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344281618] [2024-12-02 08:18:39,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 184 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-02 08:18:39,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344281618] [2024-12-02 08:18:39,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344281618] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:18:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620417122] [2024-12-02 08:18:39,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:39,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:18:39,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:18:39,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:18:39,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 08:18:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:39,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 08:18:39,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:18:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 184 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-02 08:18:40,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:18:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-02 08:18:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620417122] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 08:18:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:18:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-12-02 08:18:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351466632] [2024-12-02 08:18:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:40,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:18:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:40,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:18:40,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:18:40,446 INFO L87 Difference]: Start difference. First operand 21025 states and 24529 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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) [2024-12-02 08:18:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:43,588 INFO L93 Difference]: Finished difference Result 59100 states and 69388 transitions. [2024-12-02 08:18:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:18:43,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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 249 [2024-12-02 08:18:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:43,616 INFO L225 Difference]: With dead ends: 59100 [2024-12-02 08:18:43,616 INFO L226 Difference]: Without dead ends: 37213 [2024-12-02 08:18:43,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:18:43,629 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 878 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:43,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 158 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-12-02 08:18:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37213 states. [2024-12-02 08:18:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37213 to 35506. [2024-12-02 08:18:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35506 states, 35505 states have (on average 1.1591043514997887) internal successors, (41154), 35505 states have internal predecessors, (41154), 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) [2024-12-02 08:18:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35506 states to 35506 states and 41154 transitions. [2024-12-02 08:18:43,935 INFO L78 Accepts]: Start accepts. Automaton has 35506 states and 41154 transitions. Word has length 249 [2024-12-02 08:18:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:43,935 INFO L471 AbstractCegarLoop]: Abstraction has 35506 states and 41154 transitions. [2024-12-02 08:18:43,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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) [2024-12-02 08:18:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 35506 states and 41154 transitions. [2024-12-02 08:18:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-12-02 08:18:43,936 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:43,937 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:43,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 08:18:44,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-12-02 08:18:44,137 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:44,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1742275879, now seen corresponding path program 1 times [2024-12-02 08:18:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:44,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302295164] [2024-12-02 08:18:44,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-12-02 08:18:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302295164] [2024-12-02 08:18:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302295164] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:18:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529445158] [2024-12-02 08:18:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:44,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:44,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:44,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:44,292 INFO L87 Difference]: Start difference. First operand 35506 states and 41154 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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) [2024-12-02 08:18:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:46,167 INFO L93 Difference]: Finished difference Result 78654 states and 91329 transitions. [2024-12-02 08:18:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:46,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 257 [2024-12-02 08:18:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:46,204 INFO L225 Difference]: With dead ends: 78654 [2024-12-02 08:18:46,204 INFO L226 Difference]: Without dead ends: 42723 [2024-12-02 08:18:46,223 INFO L434 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 [2024-12-02 08:18:46,224 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 380 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:46,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 850 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 08:18:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42723 states. [2024-12-02 08:18:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42723 to 42723. [2024-12-02 08:18:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42723 states, 42722 states have (on average 1.1170825335892514) internal successors, (47724), 42722 states have internal predecessors, (47724), 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) [2024-12-02 08:18:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42723 states to 42723 states and 47724 transitions. [2024-12-02 08:18:46,675 INFO L78 Accepts]: Start accepts. Automaton has 42723 states and 47724 transitions. Word has length 257 [2024-12-02 08:18:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:46,675 INFO L471 AbstractCegarLoop]: Abstraction has 42723 states and 47724 transitions. [2024-12-02 08:18:46,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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) [2024-12-02 08:18:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 42723 states and 47724 transitions. [2024-12-02 08:18:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-12-02 08:18:46,677 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:46,677 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:46,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 08:18:46,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:46,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2014465041, now seen corresponding path program 1 times [2024-12-02 08:18:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072293323] [2024-12-02 08:18:46,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 325 proven. 73 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-12-02 08:18:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072293323] [2024-12-02 08:18:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072293323] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:18:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140613042] [2024-12-02 08:18:47,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:47,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:18:47,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:18:47,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:18:47,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 08:18:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:47,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 08:18:47,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:18:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 325 proven. 73 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-12-02 08:18:47,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:18:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-12-02 08:18:47,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140613042] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 08:18:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:18:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-12-02 08:18:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546511771] [2024-12-02 08:18:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:47,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:18:47,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:47,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:18:47,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:18:47,615 INFO L87 Difference]: Start difference. First operand 42723 states and 47724 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 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) [2024-12-02 08:18:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:50,519 INFO L93 Difference]: Finished difference Result 101643 states and 113664 transitions. [2024-12-02 08:18:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:18:50,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 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 [2024-12-02 08:18:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:50,561 INFO L225 Difference]: With dead ends: 101643 [2024-12-02 08:18:50,561 INFO L226 Difference]: Without dead ends: 58493 [2024-12-02 08:18:50,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:18:50,577 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 840 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:50,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 189 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-12-02 08:18:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58493 states. [2024-12-02 08:18:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58493 to 55940. [2024-12-02 08:18:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55940 states, 55939 states have (on average 1.1210604408373406) internal successors, (62711), 55939 states have internal predecessors, (62711), 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) [2024-12-02 08:18:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55940 states to 55940 states and 62711 transitions. [2024-12-02 08:18:51,050 INFO L78 Accepts]: Start accepts. Automaton has 55940 states and 62711 transitions. Word has length 323 [2024-12-02 08:18:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:51,050 INFO L471 AbstractCegarLoop]: Abstraction has 55940 states and 62711 transitions. [2024-12-02 08:18:51,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 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) [2024-12-02 08:18:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 55940 states and 62711 transitions. [2024-12-02 08:18:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2024-12-02 08:18:51,055 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:51,055 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:51,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 08:18:51,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-12-02 08:18:51,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:51,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1093920703, now seen corresponding path program 1 times [2024-12-02 08:18:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:51,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119905979] [2024-12-02 08:18:51,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:51,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-12-02 08:18:51,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:51,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119905979] [2024-12-02 08:18:51,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119905979] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:51,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:51,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:18:51,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176075958] [2024-12-02 08:18:51,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:51,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:51,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:51,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:51,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:51,557 INFO L87 Difference]: Start difference. First operand 55940 states and 62711 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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) [2024-12-02 08:18:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:53,594 INFO L93 Difference]: Finished difference Result 121241 states and 135987 transitions. [2024-12-02 08:18:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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 420 [2024-12-02 08:18:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:53,652 INFO L225 Difference]: With dead ends: 121241 [2024-12-02 08:18:53,652 INFO L226 Difference]: Without dead ends: 64878 [2024-12-02 08:18:53,681 INFO L434 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 [2024-12-02 08:18:53,682 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 339 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:53,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 774 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-12-02 08:18:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64878 states. [2024-12-02 08:18:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64878 to 53350. [2024-12-02 08:18:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53350 states, 53349 states have (on average 1.1076871169094078) internal successors, (59094), 53349 states have internal predecessors, (59094), 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) [2024-12-02 08:18:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53350 states to 53350 states and 59094 transitions. [2024-12-02 08:18:54,453 INFO L78 Accepts]: Start accepts. Automaton has 53350 states and 59094 transitions. Word has length 420 [2024-12-02 08:18:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:54,453 INFO L471 AbstractCegarLoop]: Abstraction has 53350 states and 59094 transitions. [2024-12-02 08:18:54,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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) [2024-12-02 08:18:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 53350 states and 59094 transitions. [2024-12-02 08:18:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-12-02 08:18:54,457 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:54,458 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-12-02 08:18:54,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 08:18:54,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:54,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1117070252, now seen corresponding path program 1 times [2024-12-02 08:18:54,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:54,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884753457] [2024-12-02 08:18:54,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-12-02 08:18:54,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884753457] [2024-12-02 08:18:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884753457] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:54,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:54,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:18:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269812127] [2024-12-02 08:18:54,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:54,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:18:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:54,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:18:54,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:18:54,762 INFO L87 Difference]: Start difference. First operand 53350 states and 59094 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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) [2024-12-02 08:18:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:18:56,637 INFO L93 Difference]: Finished difference Result 119901 states and 132834 transitions. [2024-12-02 08:18:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:18:56,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 421 [2024-12-02 08:18:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:18:56,687 INFO L225 Difference]: With dead ends: 119901 [2024-12-02 08:18:56,687 INFO L226 Difference]: Without dead ends: 63990 [2024-12-02 08:18:56,711 INFO L434 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 [2024-12-02 08:18:56,711 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 437 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:18:56,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 659 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 08:18:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63990 states. [2024-12-02 08:18:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63990 to 61851. [2024-12-02 08:18:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61851 states, 61850 states have (on average 1.0961196443007275) internal successors, (67795), 61850 states have internal predecessors, (67795), 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) [2024-12-02 08:18:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61851 states to 61851 states and 67795 transitions. [2024-12-02 08:18:57,411 INFO L78 Accepts]: Start accepts. Automaton has 61851 states and 67795 transitions. Word has length 421 [2024-12-02 08:18:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:18:57,412 INFO L471 AbstractCegarLoop]: Abstraction has 61851 states and 67795 transitions. [2024-12-02 08:18:57,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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) [2024-12-02 08:18:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 61851 states and 67795 transitions. [2024-12-02 08:18:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-12-02 08:18:57,418 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:18:57,418 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:18:57,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 08:18:57,419 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:18:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:18:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 377993779, now seen corresponding path program 1 times [2024-12-02 08:18:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:18:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638490938] [2024-12-02 08:18:57,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:18:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:18:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:18:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-02 08:18:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:18:57,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638490938] [2024-12-02 08:18:57,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638490938] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:18:57,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:18:57,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:18:57,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630276360] [2024-12-02 08:18:57,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:18:57,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:18:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:18:57,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:18:57,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:18:57,918 INFO L87 Difference]: Start difference. First operand 61851 states and 67795 transitions. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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) [2024-12-02 08:19:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:00,812 INFO L93 Difference]: Finished difference Result 145471 states and 159571 transitions. [2024-12-02 08:19:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:19:00,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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 425 [2024-12-02 08:19:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:00,882 INFO L225 Difference]: With dead ends: 145471 [2024-12-02 08:19:00,882 INFO L226 Difference]: Without dead ends: 83622 [2024-12-02 08:19:00,901 INFO L434 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 [2024-12-02 08:19:00,901 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 817 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:00,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 220 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-12-02 08:19:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83622 states. [2024-12-02 08:19:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83622 to 78925. [2024-12-02 08:19:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78925 states, 78924 states have (on average 1.097967665095535) internal successors, (86656), 78924 states have internal predecessors, (86656), 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) [2024-12-02 08:19:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78925 states to 78925 states and 86656 transitions. [2024-12-02 08:19:01,556 INFO L78 Accepts]: Start accepts. Automaton has 78925 states and 86656 transitions. Word has length 425 [2024-12-02 08:19:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:01,557 INFO L471 AbstractCegarLoop]: Abstraction has 78925 states and 86656 transitions. [2024-12-02 08:19:01,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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) [2024-12-02 08:19:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 78925 states and 86656 transitions. [2024-12-02 08:19:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-12-02 08:19:01,561 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:01,561 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-12-02 08:19:01,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 08:19:01,561 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:01,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1733652073, now seen corresponding path program 1 times [2024-12-02 08:19:01,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:01,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315652713] [2024-12-02 08:19:01,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-12-02 08:19:02,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:02,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315652713] [2024-12-02 08:19:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315652713] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:02,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:19:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:19:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139080281] [2024-12-02 08:19:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:02,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:19:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:02,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:19:02,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:19:02,052 INFO L87 Difference]: Start difference. First operand 78925 states and 86656 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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) [2024-12-02 08:19:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:04,151 INFO L93 Difference]: Finished difference Result 167643 states and 184228 transitions. [2024-12-02 08:19:04,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:19:04,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 444 [2024-12-02 08:19:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:04,235 INFO L225 Difference]: With dead ends: 167643 [2024-12-02 08:19:04,236 INFO L226 Difference]: Without dead ends: 88720 [2024-12-02 08:19:04,279 INFO L434 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 [2024-12-02 08:19:04,279 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 387 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:04,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 328 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 08:19:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88720 states. [2024-12-02 08:19:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88720 to 88286. [2024-12-02 08:19:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88286 states, 88285 states have (on average 1.0953389590530667) internal successors, (96702), 88285 states have internal predecessors, (96702), 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) [2024-12-02 08:19:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88286 states to 88286 states and 96702 transitions. [2024-12-02 08:19:05,307 INFO L78 Accepts]: Start accepts. Automaton has 88286 states and 96702 transitions. Word has length 444 [2024-12-02 08:19:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:05,308 INFO L471 AbstractCegarLoop]: Abstraction has 88286 states and 96702 transitions. [2024-12-02 08:19:05,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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) [2024-12-02 08:19:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 88286 states and 96702 transitions. [2024-12-02 08:19:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-12-02 08:19:05,312 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:05,312 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:19:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 08:19:05,312 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1451937129, now seen corresponding path program 1 times [2024-12-02 08:19:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507002257] [2024-12-02 08:19:05,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2024-12-02 08:19:05,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:05,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507002257] [2024-12-02 08:19:05,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507002257] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:05,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:19:05,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:19:05,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020984542] [2024-12-02 08:19:05,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:05,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:19:05,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:05,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:19:05,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:19:05,501 INFO L87 Difference]: Start difference. First operand 88286 states and 96702 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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) [2024-12-02 08:19:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:07,473 INFO L93 Difference]: Finished difference Result 190190 states and 208577 transitions. [2024-12-02 08:19:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:19:07,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 468 [2024-12-02 08:19:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:07,561 INFO L225 Difference]: With dead ends: 190190 [2024-12-02 08:19:07,561 INFO L226 Difference]: Without dead ends: 101906 [2024-12-02 08:19:07,594 INFO L434 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 [2024-12-02 08:19:07,594 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 475 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:07,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 264 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 08:19:07,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101906 states. [2024-12-02 08:19:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101906 to 101449. [2024-12-02 08:19:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101449 states, 101448 states have (on average 1.0927963094393187) internal successors, (110862), 101448 states have internal predecessors, (110862), 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) [2024-12-02 08:19:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101449 states to 101449 states and 110862 transitions. [2024-12-02 08:19:08,556 INFO L78 Accepts]: Start accepts. Automaton has 101449 states and 110862 transitions. Word has length 468 [2024-12-02 08:19:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:08,557 INFO L471 AbstractCegarLoop]: Abstraction has 101449 states and 110862 transitions. [2024-12-02 08:19:08,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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) [2024-12-02 08:19:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 101449 states and 110862 transitions. [2024-12-02 08:19:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-12-02 08:19:08,561 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:08,562 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-12-02 08:19:08,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 08:19:08,562 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:08,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1632310757, now seen corresponding path program 1 times [2024-12-02 08:19:08,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:08,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444315887] [2024-12-02 08:19:08,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-12-02 08:19:08,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:08,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444315887] [2024-12-02 08:19:08,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444315887] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:08,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:19:08,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:19:08,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711501906] [2024-12-02 08:19:08,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:08,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:19:08,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:08,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:19:08,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:19:08,721 INFO L87 Difference]: Start difference. First operand 101449 states and 110862 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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) [2024-12-02 08:19:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:10,822 INFO L93 Difference]: Finished difference Result 208447 states and 227581 transitions. [2024-12-02 08:19:10,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:19:10,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 471 [2024-12-02 08:19:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:10,915 INFO L225 Difference]: With dead ends: 208447 [2024-12-02 08:19:10,916 INFO L226 Difference]: Without dead ends: 105293 [2024-12-02 08:19:10,954 INFO L434 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 [2024-12-02 08:19:10,955 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 424 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:10,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 807 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 08:19:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105293 states. [2024-12-02 08:19:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105293 to 102292. [2024-12-02 08:19:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102292 states, 102291 states have (on average 1.0912103704138194) internal successors, (111621), 102291 states have internal predecessors, (111621), 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) [2024-12-02 08:19:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102292 states to 102292 states and 111621 transitions. [2024-12-02 08:19:12,189 INFO L78 Accepts]: Start accepts. Automaton has 102292 states and 111621 transitions. Word has length 471 [2024-12-02 08:19:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:12,189 INFO L471 AbstractCegarLoop]: Abstraction has 102292 states and 111621 transitions. [2024-12-02 08:19:12,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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) [2024-12-02 08:19:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 102292 states and 111621 transitions. [2024-12-02 08:19:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2024-12-02 08:19:12,195 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:12,195 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:19:12,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 08:19:12,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:12,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1828137218, now seen corresponding path program 1 times [2024-12-02 08:19:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341129728] [2024-12-02 08:19:12,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-12-02 08:19:12,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:12,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341129728] [2024-12-02 08:19:12,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341129728] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:12,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:19:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:19:12,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51762579] [2024-12-02 08:19:12,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:12,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:19:12,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:12,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:19:12,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:19:12,790 INFO L87 Difference]: Start difference. First operand 102292 states and 111621 transitions. Second operand has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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) [2024-12-02 08:19:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:16,112 INFO L93 Difference]: Finished difference Result 212667 states and 231695 transitions. [2024-12-02 08:19:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:19:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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 509 [2024-12-02 08:19:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:16,202 INFO L225 Difference]: With dead ends: 212667 [2024-12-02 08:19:16,203 INFO L226 Difference]: Without dead ends: 110371 [2024-12-02 08:19:16,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:19:16,236 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 791 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 3202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:16,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 383 Invalid, 3202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-12-02 08:19:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110371 states. [2024-12-02 08:19:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110371 to 106116. [2024-12-02 08:19:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106116 states, 106115 states have (on average 1.0807520143240823) internal successors, (114684), 106115 states have internal predecessors, (114684), 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) [2024-12-02 08:19:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106116 states to 106116 states and 114684 transitions. [2024-12-02 08:19:17,357 INFO L78 Accepts]: Start accepts. Automaton has 106116 states and 114684 transitions. Word has length 509 [2024-12-02 08:19:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:17,358 INFO L471 AbstractCegarLoop]: Abstraction has 106116 states and 114684 transitions. [2024-12-02 08:19:17,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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) [2024-12-02 08:19:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 106116 states and 114684 transitions. [2024-12-02 08:19:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2024-12-02 08:19:17,365 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:17,365 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:19:17,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 08:19:17,365 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:17,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:17,366 INFO L85 PathProgramCache]: Analyzing trace with hash -13785663, now seen corresponding path program 1 times [2024-12-02 08:19:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:17,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028331748] [2024-12-02 08:19:17,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:17,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-12-02 08:19:18,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028331748] [2024-12-02 08:19:18,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028331748] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:18,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:19:18,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:19:18,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675451598] [2024-12-02 08:19:18,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:18,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:19:18,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:18,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:19:18,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:19:18,060 INFO L87 Difference]: Start difference. First operand 106116 states and 114684 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2024-12-02 08:19:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:19,847 INFO L93 Difference]: Finished difference Result 211804 states and 228938 transitions. [2024-12-02 08:19:19,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:19:19,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 529 [2024-12-02 08:19:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:19,949 INFO L225 Difference]: With dead ends: 211804 [2024-12-02 08:19:19,949 INFO L226 Difference]: Without dead ends: 106115 [2024-12-02 08:19:19,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:19:19,999 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 599 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:19,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 540 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 08:19:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106115 states. [2024-12-02 08:19:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106115 to 105688. [2024-12-02 08:19:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105688 states, 105687 states have (on average 1.0805207830669807) internal successors, (114197), 105687 states have internal predecessors, (114197), 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) [2024-12-02 08:19:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105688 states to 105688 states and 114197 transitions. [2024-12-02 08:19:21,244 INFO L78 Accepts]: Start accepts. Automaton has 105688 states and 114197 transitions. Word has length 529 [2024-12-02 08:19:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:21,245 INFO L471 AbstractCegarLoop]: Abstraction has 105688 states and 114197 transitions. [2024-12-02 08:19:21,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2024-12-02 08:19:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 105688 states and 114197 transitions. [2024-12-02 08:19:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2024-12-02 08:19:21,253 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:21,253 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-12-02 08:19:21,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 08:19:21,253 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:21,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash -998465671, now seen corresponding path program 1 times [2024-12-02 08:19:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:21,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825315178] [2024-12-02 08:19:21,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 580 proven. 141 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-02 08:19:21,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:21,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825315178] [2024-12-02 08:19:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825315178] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:19:21,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071822941] [2024-12-02 08:19:21,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:21,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:19:21,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:19:21,954 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:19:21,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 08:19:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:22,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 08:19:22,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:19:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 639 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-12-02 08:19:22,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:19:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071822941] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 08:19:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-12-02 08:19:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532425227] [2024-12-02 08:19:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:22,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:19:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:22,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:19:22,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:19:22,578 INFO L87 Difference]: Start difference. First operand 105688 states and 114197 transitions. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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) [2024-12-02 08:19:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:26,465 INFO L93 Difference]: Finished difference Result 217765 states and 234869 transitions. [2024-12-02 08:19:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:19:26,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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 532 [2024-12-02 08:19:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:26,577 INFO L225 Difference]: With dead ends: 217765 [2024-12-02 08:19:26,577 INFO L226 Difference]: Without dead ends: 112504 [2024-12-02 08:19:26,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:19:26,630 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1257 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:26,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 183 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-12-02 08:19:26,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112504 states. [2024-12-02 08:19:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112504 to 106527. [2024-12-02 08:19:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106527 states, 106526 states have (on average 1.06740138557723) internal successors, (113706), 106526 states have internal predecessors, (113706), 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) [2024-12-02 08:19:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106527 states to 106527 states and 113706 transitions. [2024-12-02 08:19:27,976 INFO L78 Accepts]: Start accepts. Automaton has 106527 states and 113706 transitions. Word has length 532 [2024-12-02 08:19:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:27,977 INFO L471 AbstractCegarLoop]: Abstraction has 106527 states and 113706 transitions. [2024-12-02 08:19:27,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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) [2024-12-02 08:19:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 106527 states and 113706 transitions. [2024-12-02 08:19:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2024-12-02 08:19:27,983 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:27,984 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-12-02 08:19:27,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 08:19:28,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:19:28,184 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash -331083781, now seen corresponding path program 1 times [2024-12-02 08:19:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:28,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067158] [2024-12-02 08:19:28,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-02 08:19:28,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:28,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067158] [2024-12-02 08:19:28,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067158] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:28,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:19:28,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:19:28,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808432878] [2024-12-02 08:19:28,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:28,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:19:28,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:28,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:19:28,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:19:28,706 INFO L87 Difference]: Start difference. First operand 106527 states and 113706 transitions. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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) [2024-12-02 08:19:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:31,529 INFO L93 Difference]: Finished difference Result 236096 states and 251776 transitions. [2024-12-02 08:19:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:19:31,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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 532 [2024-12-02 08:19:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:31,627 INFO L225 Difference]: With dead ends: 236096 [2024-12-02 08:19:31,627 INFO L226 Difference]: Without dead ends: 129996 [2024-12-02 08:19:31,655 INFO L434 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 [2024-12-02 08:19:31,657 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 688 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:31,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 717 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-12-02 08:19:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129996 states. [2024-12-02 08:19:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129996 to 106529. [2024-12-02 08:19:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106529 states, 106528 states have (on average 1.0660295884650044) internal successors, (113562), 106528 states have internal predecessors, (113562), 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) [2024-12-02 08:19:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106529 states to 106529 states and 113562 transitions. [2024-12-02 08:19:32,810 INFO L78 Accepts]: Start accepts. Automaton has 106529 states and 113562 transitions. Word has length 532 [2024-12-02 08:19:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:32,810 INFO L471 AbstractCegarLoop]: Abstraction has 106529 states and 113562 transitions. [2024-12-02 08:19:32,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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) [2024-12-02 08:19:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 106529 states and 113562 transitions. [2024-12-02 08:19:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2024-12-02 08:19:32,818 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:32,819 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:19:32,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 08:19:32,819 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:32,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:32,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2020144656, now seen corresponding path program 1 times [2024-12-02 08:19:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:32,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831271066] [2024-12-02 08:19:32,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:32,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 875 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-12-02 08:19:33,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:33,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831271066] [2024-12-02 08:19:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831271066] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:33,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:19:33,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:19:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502405012] [2024-12-02 08:19:33,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:33,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:19:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:33,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:19:33,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:19:33,352 INFO L87 Difference]: Start difference. First operand 106529 states and 113562 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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) [2024-12-02 08:19:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:36,186 INFO L93 Difference]: Finished difference Result 221151 states and 235625 transitions. [2024-12-02 08:19:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:19:36,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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 568 [2024-12-02 08:19:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:36,280 INFO L225 Difference]: With dead ends: 221151 [2024-12-02 08:19:36,280 INFO L226 Difference]: Without dead ends: 115049 [2024-12-02 08:19:36,326 INFO L434 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 [2024-12-02 08:19:36,327 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 738 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:36,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 151 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 08:19:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115049 states. [2024-12-02 08:19:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115049 to 108229. [2024-12-02 08:19:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108229 states, 108228 states have (on average 1.0608530140074657) internal successors, (114814), 108228 states have internal predecessors, (114814), 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) [2024-12-02 08:19:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108229 states to 108229 states and 114814 transitions. [2024-12-02 08:19:37,530 INFO L78 Accepts]: Start accepts. Automaton has 108229 states and 114814 transitions. Word has length 568 [2024-12-02 08:19:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:37,531 INFO L471 AbstractCegarLoop]: Abstraction has 108229 states and 114814 transitions. [2024-12-02 08:19:37,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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) [2024-12-02 08:19:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 108229 states and 114814 transitions. [2024-12-02 08:19:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2024-12-02 08:19:37,540 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:37,541 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-12-02 08:19:37,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 08:19:37,541 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:37,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash -944979259, now seen corresponding path program 1 times [2024-12-02 08:19:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314046026] [2024-12-02 08:19:37,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 653 proven. 44 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-02 08:19:38,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:38,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314046026] [2024-12-02 08:19:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314046026] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:19:38,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818970317] [2024-12-02 08:19:38,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:38,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:19:38,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:19:38,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:19:38,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 08:19:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:38,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 08:19:38,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:19:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 518 proven. 82 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-12-02 08:19:39,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:19:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 518 proven. 82 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-12-02 08:19:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818970317] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 08:19:40,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 08:19:40,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-12-02 08:19:40,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039599810] [2024-12-02 08:19:40,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 08:19:40,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 08:19:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 08:19:40,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-12-02 08:19:40,836 INFO L87 Difference]: Start difference. First operand 108229 states and 114814 transitions. Second operand has 10 states, 10 states have (on average 120.1) internal successors, (1201), 9 states have internal predecessors, (1201), 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) [2024-12-02 08:19:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:49,734 INFO L93 Difference]: Finished difference Result 244639 states and 259666 transitions. [2024-12-02 08:19:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 08:19:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 120.1) internal successors, (1201), 9 states have internal predecessors, (1201), 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 600 [2024-12-02 08:19:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:49,840 INFO L225 Difference]: With dead ends: 244639 [2024-12-02 08:19:49,840 INFO L226 Difference]: Without dead ends: 136836 [2024-12-02 08:19:49,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-12-02 08:19:49,876 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 7784 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 9780 mSolverCounterSat, 1881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7784 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 11661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1881 IncrementalHoareTripleChecker+Valid, 9780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:49,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7784 Valid, 351 Invalid, 11661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1881 Valid, 9780 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-12-02 08:19:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136836 states. [2024-12-02 08:19:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136836 to 117611. [2024-12-02 08:19:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117611 states, 117610 states have (on average 1.061015219794235) internal successors, (124786), 117610 states have internal predecessors, (124786), 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) [2024-12-02 08:19:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117611 states to 117611 states and 124786 transitions. [2024-12-02 08:19:51,070 INFO L78 Accepts]: Start accepts. Automaton has 117611 states and 124786 transitions. Word has length 600 [2024-12-02 08:19:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:51,071 INFO L471 AbstractCegarLoop]: Abstraction has 117611 states and 124786 transitions. [2024-12-02 08:19:51,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 120.1) internal successors, (1201), 9 states have internal predecessors, (1201), 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) [2024-12-02 08:19:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 117611 states and 124786 transitions. [2024-12-02 08:19:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2024-12-02 08:19:51,079 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:51,079 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 08:19:51,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 08:19:51,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:19:51,279 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:51,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1964398361, now seen corresponding path program 1 times [2024-12-02 08:19:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:51,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658822188] [2024-12-02 08:19:51,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:51,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-12-02 08:19:51,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:51,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658822188] [2024-12-02 08:19:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658822188] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:51,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:19:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:19:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666099370] [2024-12-02 08:19:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:51,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:19:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:51,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:19:51,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:19:51,997 INFO L87 Difference]: Start difference. First operand 117611 states and 124786 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 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) [2024-12-02 08:19:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:54,958 INFO L93 Difference]: Finished difference Result 249711 states and 264768 transitions. [2024-12-02 08:19:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:19:54,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 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 622 [2024-12-02 08:19:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:19:55,051 INFO L225 Difference]: With dead ends: 249711 [2024-12-02 08:19:55,051 INFO L226 Difference]: Without dead ends: 132102 [2024-12-02 08:19:55,084 INFO L434 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 [2024-12-02 08:19:55,084 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 686 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:19:55,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 254 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 08:19:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132102 states. [2024-12-02 08:19:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132102 to 127394. [2024-12-02 08:19:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127394 states, 127393 states have (on average 1.060489979826207) internal successors, (135099), 127393 states have internal predecessors, (135099), 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) [2024-12-02 08:19:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127394 states to 127394 states and 135099 transitions. [2024-12-02 08:19:56,271 INFO L78 Accepts]: Start accepts. Automaton has 127394 states and 135099 transitions. Word has length 622 [2024-12-02 08:19:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:19:56,272 INFO L471 AbstractCegarLoop]: Abstraction has 127394 states and 135099 transitions. [2024-12-02 08:19:56,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 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) [2024-12-02 08:19:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 127394 states and 135099 transitions. [2024-12-02 08:19:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2024-12-02 08:19:56,281 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:19:56,282 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:19:56,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 08:19:56,282 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:19:56,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:19:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash 108149611, now seen corresponding path program 1 times [2024-12-02 08:19:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:19:56,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437966057] [2024-12-02 08:19:56,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:19:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:19:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:19:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-02 08:19:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:19:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437966057] [2024-12-02 08:19:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437966057] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:19:56,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:19:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:19:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194543657] [2024-12-02 08:19:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:19:56,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:19:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:19:56,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:19:56,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:19:56,948 INFO L87 Difference]: Start difference. First operand 127394 states and 135099 transitions. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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) [2024-12-02 08:19:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:19:59,949 INFO L93 Difference]: Finished difference Result 272661 states and 288878 transitions. [2024-12-02 08:19:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:19:59,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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 630 [2024-12-02 08:19:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:20:00,063 INFO L225 Difference]: With dead ends: 272661 [2024-12-02 08:20:00,063 INFO L226 Difference]: Without dead ends: 145694 [2024-12-02 08:20:00,108 INFO L434 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 [2024-12-02 08:20:00,109 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 556 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:20:00,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 679 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 08:20:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145694 states. [2024-12-02 08:20:01,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145694 to 141861. [2024-12-02 08:20:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141861 states, 141860 states have (on average 1.0585013393486535) internal successors, (150159), 141860 states have internal predecessors, (150159), 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) [2024-12-02 08:20:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141861 states to 141861 states and 150159 transitions. [2024-12-02 08:20:01,792 INFO L78 Accepts]: Start accepts. Automaton has 141861 states and 150159 transitions. Word has length 630 [2024-12-02 08:20:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:20:01,793 INFO L471 AbstractCegarLoop]: Abstraction has 141861 states and 150159 transitions. [2024-12-02 08:20:01,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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) [2024-12-02 08:20:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 141861 states and 150159 transitions. [2024-12-02 08:20:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2024-12-02 08:20:01,801 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:20:01,802 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:20:01,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 08:20:01,802 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:20:01,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:20:01,802 INFO L85 PathProgramCache]: Analyzing trace with hash 887835875, now seen corresponding path program 1 times [2024-12-02 08:20:01,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:20:01,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594837466] [2024-12-02 08:20:01,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:01,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:20:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:20:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-12-02 08:20:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:20:02,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594837466] [2024-12-02 08:20:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594837466] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:20:02,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:20:02,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:20:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372547001] [2024-12-02 08:20:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:20:02,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:20:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:20:02,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:20:02,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:20:02,165 INFO L87 Difference]: Start difference. First operand 141861 states and 150159 transitions. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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) [2024-12-02 08:20:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:20:04,307 INFO L93 Difference]: Finished difference Result 294797 states and 312236 transitions. [2024-12-02 08:20:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:20:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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 634 [2024-12-02 08:20:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:20:04,438 INFO L225 Difference]: With dead ends: 294797 [2024-12-02 08:20:04,438 INFO L226 Difference]: Without dead ends: 152936 [2024-12-02 08:20:04,690 INFO L434 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 [2024-12-02 08:20:04,691 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 117 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:20:04,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 730 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 08:20:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152936 states. [2024-12-02 08:20:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152936 to 144835. [2024-12-02 08:20:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144835 states, 144834 states have (on average 1.0576729221039258) internal successors, (153187), 144834 states have internal predecessors, (153187), 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) [2024-12-02 08:20:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144835 states to 144835 states and 153187 transitions. [2024-12-02 08:20:06,366 INFO L78 Accepts]: Start accepts. Automaton has 144835 states and 153187 transitions. Word has length 634 [2024-12-02 08:20:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:20:06,366 INFO L471 AbstractCegarLoop]: Abstraction has 144835 states and 153187 transitions. [2024-12-02 08:20:06,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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) [2024-12-02 08:20:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 144835 states and 153187 transitions. [2024-12-02 08:20:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2024-12-02 08:20:06,381 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:20:06,381 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:20:06,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 08:20:06,381 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:20:06,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:20:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash 943208416, now seen corresponding path program 1 times [2024-12-02 08:20:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:20:06,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475294710] [2024-12-02 08:20:06,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:20:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:20:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-12-02 08:20:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:20:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475294710] [2024-12-02 08:20:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475294710] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:20:07,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:20:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:20:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329011950] [2024-12-02 08:20:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:20:07,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:20:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:20:07,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:20:07,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:20:07,116 INFO L87 Difference]: Start difference. First operand 144835 states and 153187 transitions. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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) [2024-12-02 08:20:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:20:09,029 INFO L93 Difference]: Finished difference Result 293502 states and 310350 transitions. [2024-12-02 08:20:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:20:09,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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 668 [2024-12-02 08:20:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:20:09,149 INFO L225 Difference]: With dead ends: 293502 [2024-12-02 08:20:09,149 INFO L226 Difference]: Without dead ends: 149094 [2024-12-02 08:20:09,208 INFO L434 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 [2024-12-02 08:20:09,209 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 338 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:20:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 732 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 08:20:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149094 states. [2024-12-02 08:20:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149094 to 146110. [2024-12-02 08:20:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146110 states, 146109 states have (on average 1.0570396074163808) internal successors, (154443), 146109 states have internal predecessors, (154443), 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) [2024-12-02 08:20:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146110 states to 146110 states and 154443 transitions. [2024-12-02 08:20:10,760 INFO L78 Accepts]: Start accepts. Automaton has 146110 states and 154443 transitions. Word has length 668 [2024-12-02 08:20:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:20:10,760 INFO L471 AbstractCegarLoop]: Abstraction has 146110 states and 154443 transitions. [2024-12-02 08:20:10,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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) [2024-12-02 08:20:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 146110 states and 154443 transitions. [2024-12-02 08:20:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2024-12-02 08:20:10,769 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:20:10,769 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-12-02 08:20:10,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 08:20:10,770 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:20:10,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:20:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash -920320426, now seen corresponding path program 1 times [2024-12-02 08:20:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:20:10,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392682079] [2024-12-02 08:20:10,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:20:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:20:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 857 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-12-02 08:20:11,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:20:11,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392682079] [2024-12-02 08:20:11,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392682079] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:20:11,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:20:11,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:20:11,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935378460] [2024-12-02 08:20:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:20:11,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:20:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:20:11,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:20:11,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:20:11,459 INFO L87 Difference]: Start difference. First operand 146110 states and 154443 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2024-12-02 08:20:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:20:14,479 INFO L93 Difference]: Finished difference Result 321604 states and 339700 transitions. [2024-12-02 08:20:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:20:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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 674 [2024-12-02 08:20:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:20:14,625 INFO L225 Difference]: With dead ends: 321604 [2024-12-02 08:20:14,625 INFO L226 Difference]: Without dead ends: 175071 [2024-12-02 08:20:14,687 INFO L434 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 [2024-12-02 08:20:14,687 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 611 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:20:14,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 197 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 08:20:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175071 states. [2024-12-02 08:20:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175071 to 166135. [2024-12-02 08:20:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166135 states, 166134 states have (on average 1.0560571586791385) internal successors, (175447), 166134 states have internal predecessors, (175447), 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) [2024-12-02 08:20:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166135 states to 166135 states and 175447 transitions. [2024-12-02 08:20:16,470 INFO L78 Accepts]: Start accepts. Automaton has 166135 states and 175447 transitions. Word has length 674 [2024-12-02 08:20:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:20:16,471 INFO L471 AbstractCegarLoop]: Abstraction has 166135 states and 175447 transitions. [2024-12-02 08:20:16,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2024-12-02 08:20:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 166135 states and 175447 transitions. [2024-12-02 08:20:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2024-12-02 08:20:16,480 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:20:16,481 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-12-02 08:20:16,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 08:20:16,481 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:20:16,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:20:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1285125026, now seen corresponding path program 1 times [2024-12-02 08:20:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:20:16,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998090321] [2024-12-02 08:20:16,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:16,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:20:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:20:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 966 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-12-02 08:20:17,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:20:17,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998090321] [2024-12-02 08:20:17,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998090321] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:20:17,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:20:17,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 08:20:17,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163479361] [2024-12-02 08:20:17,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:20:17,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:20:17,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:20:17,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:20:17,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:20:17,022 INFO L87 Difference]: Start difference. First operand 166135 states and 175447 transitions. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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) [2024-12-02 08:20:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:20:20,650 INFO L93 Difference]: Finished difference Result 289217 states and 304877 transitions. [2024-12-02 08:20:20,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:20:20,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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 693 [2024-12-02 08:20:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:20:20,780 INFO L225 Difference]: With dead ends: 289217 [2024-12-02 08:20:20,780 INFO L226 Difference]: Without dead ends: 123084 [2024-12-02 08:20:20,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:20:20,841 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1395 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:20:20,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 121 Invalid, 3141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-12-02 08:20:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123084 states. [2024-12-02 08:20:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123084 to 105194. [2024-12-02 08:20:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105194 states, 105193 states have (on average 1.0445276776971852) internal successors, (109877), 105193 states have internal predecessors, (109877), 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) [2024-12-02 08:20:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105194 states to 105194 states and 109877 transitions. [2024-12-02 08:20:22,172 INFO L78 Accepts]: Start accepts. Automaton has 105194 states and 109877 transitions. Word has length 693 [2024-12-02 08:20:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:20:22,172 INFO L471 AbstractCegarLoop]: Abstraction has 105194 states and 109877 transitions. [2024-12-02 08:20:22,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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) [2024-12-02 08:20:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 105194 states and 109877 transitions. [2024-12-02 08:20:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2024-12-02 08:20:22,183 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:20:22,183 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-12-02 08:20:22,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 08:20:22,183 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:20:22,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:20:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1823041731, now seen corresponding path program 1 times [2024-12-02 08:20:22,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:20:22,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109934061] [2024-12-02 08:20:22,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:22,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:20:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:20:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 959 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-12-02 08:20:22,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:20:22,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109934061] [2024-12-02 08:20:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109934061] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:20:22,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:20:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:20:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660313389] [2024-12-02 08:20:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:20:22,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:20:22,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:20:22,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:20:22,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:20:22,822 INFO L87 Difference]: Start difference. First operand 105194 states and 109877 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 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) [2024-12-02 08:20:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:20:25,636 INFO L93 Difference]: Finished difference Result 230856 states and 241046 transitions. [2024-12-02 08:20:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:20:25,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 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 702 [2024-12-02 08:20:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:20:25,730 INFO L225 Difference]: With dead ends: 230856 [2024-12-02 08:20:25,730 INFO L226 Difference]: Without dead ends: 126089 [2024-12-02 08:20:25,767 INFO L434 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 [2024-12-02 08:20:25,768 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 684 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:20:25,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 587 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 08:20:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126089 states. [2024-12-02 08:20:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126089 to 105619. [2024-12-02 08:20:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105619 states, 105618 states have (on average 1.0444526501164575) internal successors, (110313), 105618 states have internal predecessors, (110313), 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) [2024-12-02 08:20:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105619 states to 105619 states and 110313 transitions. [2024-12-02 08:20:26,834 INFO L78 Accepts]: Start accepts. Automaton has 105619 states and 110313 transitions. Word has length 702 [2024-12-02 08:20:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:20:26,835 INFO L471 AbstractCegarLoop]: Abstraction has 105619 states and 110313 transitions. [2024-12-02 08:20:26,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 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) [2024-12-02 08:20:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 105619 states and 110313 transitions. [2024-12-02 08:20:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2024-12-02 08:20:26,847 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:20:26,847 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2024-12-02 08:20:26,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 08:20:26,847 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:20:26,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:20:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash -515048876, now seen corresponding path program 1 times [2024-12-02 08:20:26,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:20:26,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887412380] [2024-12-02 08:20:26,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:26,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:20:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:20:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1511 backedges. 1184 proven. 98 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-12-02 08:20:27,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:20:27,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887412380] [2024-12-02 08:20:27,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887412380] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:20:27,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88742165] [2024-12-02 08:20:27,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:27,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:20:27,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:20:27,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:20:27,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 08:20:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:20:28,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 08:20:28,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:20:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1511 backedges. 442 proven. 995 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-12-02 08:20:30,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:20:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1511 backedges. 1355 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-12-02 08:20:30,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88742165] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 08:20:30,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:20:30,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 7] total 12 [2024-12-02 08:20:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23539228] [2024-12-02 08:20:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:20:30,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:20:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:20:30,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:20:30,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:20:30,965 INFO L87 Difference]: Start difference. First operand 105619 states and 110313 transitions. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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) [2024-12-02 08:20:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:20:33,726 INFO L93 Difference]: Finished difference Result 220603 states and 230416 transitions. [2024-12-02 08:20:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:20:33,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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 724 [2024-12-02 08:20:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:20:33,818 INFO L225 Difference]: With dead ends: 220603 [2024-12-02 08:20:33,818 INFO L226 Difference]: Without dead ends: 115411 [2024-12-02 08:20:33,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1451 GetRequests, 1439 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:20:33,864 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 805 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-12-02 08:20:33,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 95 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-12-02 08:20:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115411 states. [2024-12-02 08:20:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115411 to 109446. [2024-12-02 08:20:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109446 states, 109445 states have (on average 1.0447256612910594) internal successors, (114340), 109445 states have internal predecessors, (114340), 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) [2024-12-02 08:20:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109446 states to 109446 states and 114340 transitions. [2024-12-02 08:20:35,050 INFO L78 Accepts]: Start accepts. Automaton has 109446 states and 114340 transitions. Word has length 724 [2024-12-02 08:20:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:20:35,050 INFO L471 AbstractCegarLoop]: Abstraction has 109446 states and 114340 transitions. [2024-12-02 08:20:35,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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) [2024-12-02 08:20:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 109446 states and 114340 transitions. [2024-12-02 08:20:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2024-12-02 08:20:35,062 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:20:35,062 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:20:35,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 08:20:35,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-12-02 08:20:35,262 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:20:35,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:20:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash 147307599, now seen corresponding path program 1 times [2024-12-02 08:20:35,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:20:35,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273267461] [2024-12-02 08:20:35,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:35,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:20:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:20:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 498 proven. 82 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-12-02 08:20:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:20:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273267461] [2024-12-02 08:20:36,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273267461] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:20:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863126907] [2024-12-02 08:20:36,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:36,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:20:36,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:20:36,262 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:20:36,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 08:20:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:20:36,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 08:20:36,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:20:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-12-02 08:20:37,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:20:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863126907] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:20:37,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 08:20:37,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-12-02 08:20:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994719383] [2024-12-02 08:20:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:20:37,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:20:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:20:37,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:20:37,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:20:37,470 INFO L87 Difference]: Start difference. First operand 109446 states and 114340 transitions. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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) [2024-12-02 08:20:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:20:39,277 INFO L93 Difference]: Finished difference Result 222293 states and 232076 transitions. [2024-12-02 08:20:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:20:39,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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 726 [2024-12-02 08:20:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:20:39,370 INFO L225 Difference]: With dead ends: 222293 [2024-12-02 08:20:39,370 INFO L226 Difference]: Without dead ends: 113274 [2024-12-02 08:20:39,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:20:39,416 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 310 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:20:39,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 237 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 08:20:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113274 states. [2024-12-02 08:20:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113274 to 109007. [2024-12-02 08:20:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109007 states, 109006 states have (on average 1.0397684531126727) internal successors, (113341), 109006 states have internal predecessors, (113341), 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) [2024-12-02 08:20:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109007 states to 109007 states and 113341 transitions. [2024-12-02 08:20:40,636 INFO L78 Accepts]: Start accepts. Automaton has 109007 states and 113341 transitions. Word has length 726 [2024-12-02 08:20:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:20:40,637 INFO L471 AbstractCegarLoop]: Abstraction has 109007 states and 113341 transitions. [2024-12-02 08:20:40,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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) [2024-12-02 08:20:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 109007 states and 113341 transitions. [2024-12-02 08:20:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2024-12-02 08:20:40,657 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:20:40,658 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:20:40,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 08:20:40,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-12-02 08:20:40,858 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:20:40,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:20:40,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1237000177, now seen corresponding path program 1 times [2024-12-02 08:20:40,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:20:40,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751544882] [2024-12-02 08:20:40,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:20:40,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:20:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 08:20:41,067 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 08:20:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 08:20:41,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 08:20:41,410 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 08:20:41,410 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 08:20:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 08:20:41,414 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:20:41,579 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 08:20:41,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:20:41 BoogieIcfgContainer [2024-12-02 08:20:41,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 08:20:41,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 08:20:41,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 08:20:41,582 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 08:20:41,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:15" (3/4) ... [2024-12-02 08:20:41,584 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 08:20:41,846 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 727. [2024-12-02 08:20:42,179 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 08:20:42,180 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 08:20:42,180 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 08:20:42,180 INFO L158 Benchmark]: Toolchain (without parser) took 151218.25ms. Allocated memory was 142.6MB in the beginning and 14.2GB in the end (delta: 14.1GB). Free memory was 108.7MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 6.9GB. Max. memory is 16.1GB. [2024-12-02 08:20:42,181 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:20:42,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 858.40ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 96.5MB in the end (delta: 12.2MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2024-12-02 08:20:42,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 265.52ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 96.5MB in the beginning and 208.7MB in the end (delta: -112.2MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2024-12-02 08:20:42,181 INFO L158 Benchmark]: Boogie Preprocessor took 313.84ms. Allocated memory is still 293.6MB. Free memory was 208.7MB in the beginning and 158.0MB in the end (delta: 50.7MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-12-02 08:20:42,181 INFO L158 Benchmark]: RCFGBuilder took 3450.72ms. Allocated memory was 293.6MB in the beginning and 587.2MB in the end (delta: 293.6MB). Free memory was 158.0MB in the beginning and 341.1MB in the end (delta: -183.1MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2024-12-02 08:20:42,182 INFO L158 Benchmark]: TraceAbstraction took 145725.34ms. Allocated memory was 587.2MB in the beginning and 14.2GB in the end (delta: 13.6GB). Free memory was 341.1MB in the beginning and 7.4GB in the end (delta: -7.1GB). Peak memory consumption was 6.5GB. Max. memory is 16.1GB. [2024-12-02 08:20:42,182 INFO L158 Benchmark]: Witness Printer took 597.69ms. Allocated memory is still 14.2GB. Free memory was 7.4GB in the beginning and 7.9GB in the end (delta: -448.8MB). Peak memory consumption was 172.0MB. Max. memory is 16.1GB. [2024-12-02 08:20:42,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 858.40ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 96.5MB in the end (delta: 12.2MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 265.52ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 96.5MB in the beginning and 208.7MB in the end (delta: -112.2MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 313.84ms. Allocated memory is still 293.6MB. Free memory was 208.7MB in the beginning and 158.0MB in the end (delta: 50.7MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3450.72ms. Allocated memory was 293.6MB in the beginning and 587.2MB in the end (delta: 293.6MB). Free memory was 158.0MB in the beginning and 341.1MB in the end (delta: -183.1MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. * TraceAbstraction took 145725.34ms. Allocated memory was 587.2MB in the beginning and 14.2GB in the end (delta: 13.6GB). Free memory was 341.1MB in the beginning and 7.4GB in the end (delta: -7.1GB). Peak memory consumption was 6.5GB. Max. memory is 16.1GB. * Witness Printer took 597.69ms. Allocated memory is still 14.2GB. Free memory was 7.4GB in the beginning and 7.9GB in the end (delta: -448.8MB). Peak memory consumption was 172.0MB. 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: 93]: 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] [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [\result=25, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [\result=25, a14=-101, a21=124, a24=2, a26=-554655, a28=156, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [\result=25, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [\result=21, a14=-14662, a21=124, a24=2, a26=61659, a28=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, 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 [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L689] COND FALSE !(( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && ((( 217 < a26 && (input == 3)) && a14 <= -182 ) && (a24==2))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L696] COND FALSE !(((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && ( -84 < a14 && (input == 2)))) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L708] COND FALSE !(((a24==3) && (( ((124 < a26) && (217 >= a26)) && ( -84 < a14 && ( 300 < a28 && (input == 3)))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L713] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 3)) && a26 <= -68 ) && (a24==2)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L719] COND FALSE !(((a24==2) && ( a21 <= 127 && (((input == 5) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) )) || ( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ))) && ((-68 < a26) && (124 >= a26)) )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L729] COND FALSE !(( a21 <= 127 && (( ((-114 < a14) && (-84 >= a14)) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && a26 <= -68 )) && (a24==2)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !((( a21 <= 127 && ((( 300 < a28 && ( -84 < a14 && ((-68 < a26) && (124 >= a26)) )) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 5))) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L747] COND FALSE !(((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && ( a28 <= 37 && (((input == 5) && a21 <= 127 ) && ((124 < a26) && (217 >= a26)) ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !(( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ((a24==2) && (((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((((a24==3) && (((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(((a24==2) && (( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && ((input == 4) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !(( a26 <= -68 && ( a21 <= 127 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 2)))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L786] COND FALSE !((((( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 6))) && -84 < a14 ) && (a24==2)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L791] COND FALSE !((((( -84 < a14 && ( a21 <= 127 && (input == 3))) && a26 <= -68 ) && 300 < a28 ) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !(((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && ((( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 ))) && (input == 1)))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( ((37 < a28) && (134 >= a28)) && ((((input == 5) && a21 <= 127 ) && (a24==2)) && -84 < a14 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L810] COND FALSE !((((a24==3) && ((((input == 4) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && ((-68 < a26) && (124 >= a26)) ) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !(((((((input == 6) && -84 < a14 ) && a26 <= -68 ) && (a24==3)) && a21 <= 127 ) && 300 < a28 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && (((input == 4) && a28 <= 37 ) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L830] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ((( a26 <= -68 && ((input == 5) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && (a24==3)) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L836] COND FALSE !(((((a24==2) && ((input == 6) && (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( a21 <= 127 && ( a26 <= -68 && ((a24==3) && ( -84 < a14 && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 6))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((( a14 <= -182 && (( ((37 < a28) && (134 >= a28)) && ((input == 5) && (a24==2))) && 217 < a26 )) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L857] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 5)) && 217 < a26 ))) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !((( a21 <= 127 && ( a14 <= -182 && (( ((134 < a28) && (300 >= a28)) && (input == 3)) && (a24==2)))) && 217 < a26 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((a24==2) && ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (input == 4)))) && -84 < a14 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L881] COND FALSE !(((((a24==3) && ( ((124 < a26) && (217 >= a26)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a21 <= 127 && (( a14 <= -182 && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && (a24==2)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !((( a21 <= 127 && (( ((-182 < a14) && (-114 >= a14)) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 1))) && ((124 < a26) && (217 >= a26)) )) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L894] COND FALSE !(((( ((-68 < a26) && (124 >= a26)) && ( ((-182 < a14) && (-114 >= a14)) && ((input == 5) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==3)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L901] COND FALSE !(( a21 <= 127 && (((((input == 4) && a26 <= -68 ) && (a24==3)) && -84 < a14 ) && 300 < a28 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L908] COND FALSE !(((a24==2) && (( ((-182 < a14) && (-114 >= a14)) && ( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L919] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ((((input == 4) && a21 <= 127 ) && a14 <= -182 ) && (a24==3))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L923] COND FALSE !((( -84 < a14 && ( a21 <= 127 && ( a28 <= 37 && ((input == 1) && ((-68 < a26) && (124 >= a26)) )))) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( a21 <= 127 && ( a28 <= 37 && ((( ((-114 < a14) && (-84 >= a14)) && (input == 4)) && ((124 < a26) && (217 >= a26)) ) && (a24==3))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !(((( a28 <= 37 && (( a21 <= 127 && (input == 5)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) ) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2)) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L949] COND FALSE !((( a21 <= 127 && ((( a28 <= 37 && (input == 2)) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L956] COND FALSE !((( a26 <= -68 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) )) && (input == 3)))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L962] COND FALSE !(( a21 <= 127 && ((input == 6) && ((( ((134 < a28) && (300 >= a28)) && ((a24==2) && ( -84 < a14 && 217 < a26 ))) || ( 300 < a28 && ((a24==2) && ( 217 < a26 && -84 < a14 )))) || (((a24==3) && ( a26 <= -68 && a14 <= -182 )) && a28 <= 37 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( 217 < a26 && ((((a24==3) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 4))) && a14 <= -182 ) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !(((((((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && a26 <= -68 ) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) ) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L982] COND FALSE !(( a14 <= -182 && ((((a24==2) && ((input == 2) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a26 <= -68 ) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L985] COND FALSE !(((( 300 < a28 && (((input == 2) && ((-182 < a14) && (-114 >= a14)) ) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L991] COND FALSE !(((a24==2) && (( a21 <= 127 && ((input == 5) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))))) && 217 < a26 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L998] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && ((((input == 4) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 ) && (a24==3))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1005] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && (( ((124 < a26) && (217 >= a26)) && ((input == 1) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))) && (a24==2))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1009] COND FALSE !((( ((-68 < a26) && (124 >= a26)) && ((((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 ) && (a24==3))) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1015] COND FALSE !((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && ((a24==3) && ((input == 1) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((a24==2) && ( 217 < a26 && ( a21 <= 127 && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((( -84 < a14 && (((a24==3) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 1))) && a21 <= 127 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1038] COND FALSE !(((( 217 < a26 && (((a24==3) && (input == 2)) && a14 <= -182 )) && a21 <= 127 ) && a28 <= 37 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1044] COND FALSE !(((((a24==3) && ( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 2)))) && ((124 < a26) && (217 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1050] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && (((input == 6) && (a24==2)) && a28 <= 37 )) && -84 < a14 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((124 < a26) && (217 >= a26)) && ((a24==3) && ( -84 < a14 && (( 300 < a28 && (input == 2)) && a21 <= 127 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1060] COND FALSE !(((( a28 <= 37 && (((a24==3) && (input == 3)) && a26 <= -68 )) && a21 <= 127 ) && -84 < a14 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1066] COND FALSE !((( ((-182 < a14) && (-114 >= a14)) && ((a24==3) && ( a21 <= 127 && ((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1073] COND FALSE !(((((((input == 4) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1079] COND FALSE !(((a24==2) && ( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1086] COND FALSE !(( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) && (((input == 3) && (a24==2)) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && (( ((-68 < a26) && (124 >= a26)) && ( 300 < a28 && ((input == 3) && (a24==3)))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1098] COND FALSE !(( a21 <= 127 && ( ((37 < a28) && (134 >= a28)) && ((a24==3) && (((input == 1) && 217 < a26 ) && a14 <= -182 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1104] COND FALSE !(((a24==3) && ((( a26 <= -68 && ( -84 < a14 && (input == 1))) && a21 <= 127 ) && 300 < a28 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1110] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (((input == 6) && 217 < a26 ) && a21 <= 127 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1116] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ((a24==2) && ((input == 2) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))))) && a21 <= 127 ) && 217 < a26 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1123] COND FALSE !((((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 3)) && -84 < a14 ) && a21 <= 127 ) && (a24==3)) && a26 <= -68 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1129] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && (((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 1)) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 ) && (a24==3)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1135] COND FALSE !(((( a26 <= -68 && ( ((134 < a28) && (300 >= a28)) && ((input == 1) && a21 <= 127 ))) && (a24==2)) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1140] COND FALSE !(( a14 <= -182 && ( ((134 < a28) && (300 >= a28)) && (( a21 <= 127 && ((input == 1) && 217 < a26 )) && (a24==2))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1145] COND FALSE !(((a24==2) && ( a21 <= 127 && (((input == 2) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))) && 217 < a26 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1152] COND FALSE !(( -84 < a14 && ((a24==3) && ((((input == 5) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !(((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( a21 <= 127 && ((input == 2) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 ))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1162] COND FALSE !(( a26 <= -68 && ( -84 < a14 && ((a24==3) && ( a21 <= 127 && ((input == 5) && 300 < a28 )))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1169] COND FALSE !(( a21 <= 127 && ((( ((-68 < a26) && (124 >= a26)) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 2))) && (a24==2)) && -84 < a14 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1176] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( ((-182 < a14) && (-114 >= a14)) && ((((input == 4) && 300 < a28 ) && (a24==3)) && a21 <= 127 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1182] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((a24==2) && ( a14 <= -182 && ( a21 <= 127 && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 1))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1189] COND FALSE !((( a21 <= 127 && ( a26 <= -68 && ((input == 4) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1194] COND FALSE !((( a21 <= 127 && (((a24==3) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && ((-182 < a14) && (-114 >= a14)) )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1207] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ( a21 <= 127 && (input == 6))) && (a24==2)) && a28 <= 37 ) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1212] COND FALSE !((( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && ((a24==3) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 1))))) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1219] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ( 300 < a28 && ( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==2) && (input == 5))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1226] COND FALSE !(((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( a14 <= -182 && ((( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 2)) && a21 <= 127 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1230] COND FALSE !(( a26 <= -68 && ((a24==2) && ((((input == 4) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && a21 <= 127 ) && -84 < a14 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1241] COND FALSE !((( a26 <= -68 && ((a24==3) && ( a21 <= 127 && ( a28 <= 37 && (input == 6))))) && -84 < a14 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1247] COND FALSE !(( a21 <= 127 && ((input == 5) && (( a28 <= 37 && ((a24==3) && ( a26 <= -68 && a14 <= -182 ))) || (( ((134 < a28) && (300 >= a28)) && ((a24==2) && ( 217 < a26 && -84 < a14 ))) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 )))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1254] COND FALSE !((( a21 <= 127 && ((a24==2) && (((( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) )) && (input == 3)))) && 217 < a26 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !(((( a28 <= 37 && ( a21 <= 127 && ((a24==2) && (input == 2)))) && ((-68 < a26) && (124 >= a26)) ) && -84 < a14 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !(((a24==2) && (((((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) )) || ( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 )) && (input == 1)) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1272] COND FALSE !((( ((-182 < a14) && (-114 >= a14)) && (((a24==2) && ((input == 5) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ))) && 217 < a26 )) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1277] COND FALSE !(( a14 <= -182 && ( a21 <= 127 && ((a24==2) && (((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && a26 <= -68 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1282] COND FALSE !(((a24==3) && (( ((124 < a26) && (217 >= a26)) && ( a21 <= 127 && ((input == 1) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))))) && a14 <= -182 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1289] COND FALSE !((( ((-68 < a26) && (124 >= a26)) && ((a24==2) && (( a21 <= 127 && (input == 3)) && ((37 < a28) && (134 >= a28)) ))) && -84 < a14 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1294] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && ((((input == 5) && a21 <= 127 ) && 300 < a28 ) && (a24==3))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1301] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((input == 1) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && 300 < a28 ) && (a24==3)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1307] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && (( a21 <= 127 && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 5)) && (a24==2))) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1313] COND FALSE !(((((a24==3) && ( a14 <= -182 && ((input == 1) && a28 <= 37 ))) && 217 < a26 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1316] COND FALSE !(( a21 <= 127 && (( ((-68 < a26) && (124 >= a26)) && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 ))) && (input == 6))) && (a24==3)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1323] COND FALSE !(((((a24==2) && ( -84 < a14 && ( ((-68 < a26) && (124 >= a26)) && (input == 1)))) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1327] COND FALSE !((((( ((134 < a28) && (300 >= a28)) && ((input == 5) && a14 <= -182 )) && (a24==2)) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1332] COND FALSE !(( 300 < a28 && (((((a24==3) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ) && a21 <= 127 ) && a26 <= -68 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1338] COND FALSE !(( a21 <= 127 && (((a24==2) && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 1)) && ((-182 < a14) && (-114 >= a14)) )) && a26 <= -68 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1349] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (((input == 3) && (a24==3)) && a21 <= 127 )) && ((134 < a28) && (300 >= a28)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1356] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 5)) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1362] COND FALSE !(((a24==3) && (( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 4)))) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1369] COND FALSE !(( a21 <= 127 && ((((input == 1) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && a26 <= -68 ) && (a24==2)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1374] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 3) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )) && a21 <= 127 ) && ((124 < a26) && (217 >= a26)) )) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1387] COND FALSE !((((a24==3) && (( ((124 < a26) && (217 >= a26)) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 3))) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1393] COND FALSE !(( a26 <= -68 && ((((a24==3) && ((input == 2) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1399] COND FALSE !(((a24==3) && (( a26 <= -68 && (( -84 < a14 && (input == 2)) && a21 <= 127 )) && 300 < a28 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1405] COND FALSE !(( 217 < a26 && ( a21 <= 127 && ((a24==3) && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (input == 5))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1416] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && ((( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ) || (( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 ))) && (input == 4))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1423] COND FALSE !((( 217 < a26 && ((a24==3) && (((input == 5) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 ))) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1434] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 1) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && 217 < a26 ) && a21 <= 127 )) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1438] COND FALSE !(( a21 <= 127 && (((((input == 4) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ) && (a24==3)) && 300 < a28 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1450] COND FALSE !(((a24==2) && ( ((37 < a28) && (134 >= a28)) && ((((input == 6) && -84 < a14 ) && a26 <= -68 ) && a21 <= 127 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1454] COND FALSE !(((((( 300 < a28 && (input == 4)) && a21 <= 127 ) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1461] COND FALSE !((((((input == 2) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && a26 <= -68 ) && (a24==2)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1467] COND FALSE !((( ((-68 < a26) && (124 >= a26)) && ((((input == 2) && -84 < a14 ) && (a24==2)) && a21 <= 127 )) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1472] COND FALSE !(((((a24==2) && ( ((-182 < a14) && (-114 >= a14)) && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)))) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1477] COND FALSE !(( ((124 < a26) && (217 >= a26)) && ((a24==2) && ( a21 <= 127 && (((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) )) && (input == 6)))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1484] COND FALSE !((((a24==2) && (( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))) && -84 < a14 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1491] COND FALSE !((((a24==3) && (((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && a26 <= -68 ) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1497] COND FALSE !(((a24==2) && (((( a21 <= 127 && (input == 2)) && 217 < a26 ) && ((37 < a28) && (134 >= a28)) ) && a14 <= -182 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1500] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((-68 < a26) && (124 >= a26)) && ((( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ) || (( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) ))) && (input == 6)))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1507] COND FALSE !((( 217 < a26 && ((((( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 6)) && a21 <= 127 )) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1514] COND FALSE !(( a14 <= -182 && ( a21 <= 127 && (((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 3)) && ((-68 < a26) && (124 >= a26)) ) && (a24==2))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1520] COND FALSE !(((( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 5)) && a26 <= -68 )) && (a24==2)) && -84 < a14 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1525] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (( a26 <= -68 && ((input == 2) && 300 < a28 )) && (a24==3))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1531] COND FALSE !(( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1535] COND FALSE !((( a26 <= -68 && ( -84 < a14 && ((( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 2)) && a21 <= 127 ))) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1541] COND FALSE !((((a24==2) && ((((input == 1) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a21 <= 127 ) && 217 < a26 )) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1548] COND FALSE !(((a24==2) && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))) && ((-182 < a14) && (-114 >= a14)) )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1555] COND FALSE !(((( a14 <= -182 && ( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && (input == 1)))) && 217 < a26 ) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1561] COND FALSE !(((((( a21 <= 127 && (input == 6)) && a26 <= -68 ) && (a24==2)) && a14 <= -182 ) && ((134 < a28) && (300 >= a28)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1566] COND FALSE !((( a21 <= 127 && (( ((-114 < a14) && (-84 >= a14)) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 6))) && ((-68 < a26) && (124 >= a26)) )) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1573] COND FALSE !(((((( a21 <= 127 && (input == 2)) && a14 <= -182 ) && (a24==3)) && ((37 < a28) && (134 >= a28)) ) && 217 < a26 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(((((((input == 2) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && a14 <= -182 ) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1584] COND FALSE !(( a14 <= -182 && ((a24==2) && ( 217 < a26 && ( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && (input == 6))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ) && (a24==2))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1597] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (((a24==2) && ( a14 <= -182 && ((input == 4) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1600] COND FALSE !(( a21 <= 127 && ((( a14 <= -182 && ((input == 4) && a28 <= 37 )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1605] COND FALSE !(((a24==3) && ( a21 <= 127 && ( -84 < a14 && (((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((124 < a26) && (217 >= a26)) ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1618] COND FALSE !(( ((124 < a26) && (217 >= a26)) && ((a24==3) && (( a28 <= 37 && ((input == 1) && a21 <= 127 )) && ((-114 < a14) && (-84 >= a14)) )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1623] COND FALSE !((( a26 <= -68 && ( a21 <= 127 && (( 300 < a28 && (input == 4)) && (a24==3)))) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1630] COND FALSE !((((a24==2) && (( 217 < a26 && ((input == 4) && a21 <= 127 )) && ((134 < a28) && (300 >= a28)) )) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1636] COND FALSE !((( a21 <= 127 && ((((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1642] COND FALSE !(( a21 <= 127 && ( a26 <= -68 && (((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 3)) && (a24==2)) && a14 <= -182 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1646] COND FALSE !(( a21 <= 127 && ((a24==2) && (((( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) )) && (input == 1)) && 217 < a26 )))) [L1653] CALL, EXPR calculate_output2(input) [L1659] COND FALSE !(( a21 <= 127 && ((( -84 < a14 && ((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==1)) && 217 < a26 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1664] COND FALSE !(((( ((124 < a26) && (217 >= a26)) && ((input == 5) && (( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( -84 < a14 && a28 <= 37 ))))) && a21 <= 127 ) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1669] COND FALSE !((( -84 < a14 && (((( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 5)) && (a24==2)) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1673] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && (( ((124 < a26) && (217 >= a26)) && ((a24==3) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1680] COND FALSE !((((a24==3) && ((input == 4) && (( 300 < a28 && ( -84 < a14 && ((-68 < a26) && (124 >= a26)) )) || ( a28 <= 37 && ( ((124 < a26) && (217 >= a26)) && a14 <= -182 ))))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1687] COND FALSE !(( a21 <= 127 && ((a24==2) && ((input == 3) && (( 300 < a28 && ( ((124 < a26) && (217 >= a26)) && -84 < a14 )) || ( a28 <= 37 && ( a14 <= -182 && 217 < a26 ))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1692] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 1)) && (a24==3)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1704] COND FALSE !((( a21 <= 127 && (((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 3)) && (a24==2)) && ((-114 < a14) && (-84 >= a14)) )) && a26 <= -68 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1710] COND FALSE !((((( 217 < a26 && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && ((-182 < a14) && (-114 >= a14)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1717] COND FALSE !(( -84 < a14 && ((a24==3) && ( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ( ((134 < a28) && (300 >= a28)) && (input == 1))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1728] COND FALSE !((((a24==2) && ( a26 <= -68 && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4))))) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1733] COND FALSE !((( a14 <= -182 && ( a26 <= -68 && ((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6))))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1740] COND FALSE !((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ( a26 <= -68 && ((input == 1) && a21 <= 127 )))) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1745] COND FALSE !(((((a24==3) && ( a14 <= -182 && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)))) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1751] COND FALSE !(( a21 <= 127 && (( a14 <= -182 && ((a24==2) && ( ((134 < a28) && (300 >= a28)) && (input == 6)))) && 217 < a26 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1755] COND FALSE !((( -84 < a14 && ( ((134 < a28) && (300 >= a28)) && (((input == 2) && (a24==2)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1759] COND FALSE !(( a14 <= -182 && ((a24==3) && (( ((124 < a26) && (217 >= a26)) && ((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && a21 <= 127 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1766] COND FALSE !(((((input == 6) && ((( ((124 < a26) && (217 >= a26)) && -84 < a14 ) && 300 < a28 ) || ( a28 <= 37 && ( a14 <= -182 && 217 < a26 )))) && a21 <= 127 ) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1773] COND FALSE !((((a24==3) && ( a28 <= 37 && ( a21 <= 127 && ( a26 <= -68 && (input == 5))))) && -84 < a14 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1780] COND FALSE !(( a21 <= 127 && ( 217 < a26 && (((input == 1) && (( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )))) && (a24==2))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1787] COND FALSE !(((( a21 <= 127 && ( a26 <= -68 && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6)))) && ((-182 < a14) && (-114 >= a14)) ) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1794] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((a24==3) && (((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 6)) && a26 <= -68 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1801] COND FALSE !((((a24==3) && ( -84 < a14 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1811] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ((a24==2) && ( a28 <= 37 && (input == 1)))) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1817] COND FALSE !(( a21 <= 127 && ( ((-114 < a14) && (-84 >= a14)) && ( 300 < a28 && ( ((-68 < a26) && (124 >= a26)) && ((a24==2) && (input == 2))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1822] COND FALSE !((( ((124 < a26) && (217 >= a26)) && (((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)) && a21 <= 127 ) && a14 <= -182 )) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1828] COND FALSE !(( a21 <= 127 && (((a24==3) && (((input == 1) && 300 < a28 ) && ((124 < a26) && (217 >= a26)) )) && -84 < a14 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1841] COND FALSE !((((a24==3) && (( a21 <= 127 && ((input == 4) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && ((-114 < a14) && (-84 >= a14)) )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1847] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 4))) && (a24==2)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1852] COND FALSE !((( a26 <= -68 && ((a24==2) && (( -84 < a14 && (input == 5)) && a21 <= 127 ))) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1855] COND FALSE !(((a24==2) && (((( 300 < a28 && ( ((124 < a26) && (217 >= a26)) && -84 < a14 )) || (( a14 <= -182 && 217 < a26 ) && a28 <= 37 )) && (input == 4)) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1862] COND FALSE !(((a24==3) && ( a14 <= -182 && ( ((37 < a28) && (134 >= a28)) && (((input == 3) && 217 < a26 ) && a21 <= 127 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1868] COND FALSE !(((a24==3) && ( -84 < a14 && (( 300 < a28 && ( a21 <= 127 && (input == 5))) && ((124 < a26) && (217 >= a26)) )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1878] COND FALSE !((((input == 2) && ((((a24==3) && ( a14 <= -182 && a26 <= -68 )) && a28 <= 37 ) || ((((a24==2) && ( 217 < a26 && -84 < a14 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( 217 < a26 && -84 < a14 )) && 300 < a28 )))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1885] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))) && (a24==3)) && a21 <= 127 ) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1891] COND FALSE !(( a14 <= -182 && ((( 217 < a26 && ((input == 5) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))) && (a24==3)) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1898] COND FALSE !(((a24==3) && ((( a26 <= -68 && ((input == 4) && a28 <= 37 )) && ((-182 < a14) && (-114 >= a14)) ) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1905] COND FALSE !(( a14 <= -182 && ( a21 <= 127 && ((a24==3) && (((input == 1) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )) && a26 <= -68 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1910] COND FALSE !((((((a24==2) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ))) && a21 <= 127 ) && a26 <= -68 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1916] COND FALSE !(((( -84 < a14 && (((a24==2) && (input == 4)) && ((124 < a26) && (217 >= a26)) )) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1926] COND FALSE !((( a14 <= -182 && ( a21 <= 127 && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==2)))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1932] COND TRUE ((((( ((37 < a28) && (134 >= a28)) && (input == 4)) && (a24==2)) && a14 <= -182 ) && 217 < a26 ) && a21 <= 127 ) [L1933] a26 = ((((((a26 % 95)- -13) * 5) * 5) % 95)- -18) [L1934] a24 = 1 [L1936] return -1; VAL [\result=-1, a14=-14662, a21=124, a24=1, a26=63, a28=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1653] RET, EXPR calculate_output2(input) [L1653] return calculate_output2(input); [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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 [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND TRUE (((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 ) VAL [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] reach_error() VAL [a14=-14662, a21=124, a24=1, a26=63, a28=64, input=2, 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: 145.5s, OverallIterations: 34, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 92.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26680 SdHoareTripleChecker+Valid, 74.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26680 mSDsluCounter, 15222 SdHoareTripleChecker+Invalid, 63.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2444 mSDsCounter, 11775 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67039 IncrementalHoareTripleChecker+Invalid, 78814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11775 mSolverCounterUnsat, 12778 mSDtfsCounter, 67039 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5170 GetRequests, 5082 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166135occurred in iteration=29, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 173732 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 18092 NumberOfCodeBlocks, 18092 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 19217 ConstructedInterpolants, 0 QuantifiedInterpolants, 55972 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4075 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 43 InterpolantComputations, 32 PerfectInterpolantSequences, 24042/25852 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-02 08:20:42,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37af2bc6-1318-41be-b7e4-5c2aaab95cc8/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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