./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label00.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC --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 e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:47:31,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:47:31,671 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:47:31,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:47:31,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:47:31,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:47:31,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:47:31,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:47:31,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:47:31,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:47:31,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:47:31,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:47:31,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:47:31,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:47:31,735 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:47:31,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:47:31,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:47:31,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:47:31,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:47:31,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:47:31,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:47:31,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:47:31,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:47:31,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:47:31,737 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:47:31,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:47:31,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:47:31,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:47:31,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:47:31,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:47:31,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:47:31,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:47:31,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:47:31,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:47:31,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:47:31,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:47:31,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:47:31,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:47:31,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:47:31,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:47:31,741 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:47:31,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:47:31,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:47:31,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:47:31,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:47:31,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:47:31,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:47:31,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:47:31,742 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_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC 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 -> e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 [2024-11-24 01:47:32,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:47:32,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:47:32,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:47:32,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:47:32,142 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:47:32,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2024-11-24 01:47:35,519 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/data/d2a9d1765/f49132e547894a5cb05e9fb5eed26862/FLAG0e2918e0c [2024-11-24 01:47:36,121 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:47:36,122 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2024-11-24 01:47:36,154 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/data/d2a9d1765/f49132e547894a5cb05e9fb5eed26862/FLAG0e2918e0c [2024-11-24 01:47:36,177 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/data/d2a9d1765/f49132e547894a5cb05e9fb5eed26862 [2024-11-24 01:47:36,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:47:36,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:47:36,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:47:36,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:47:36,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:47:36,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:47:36" (1/1) ... [2024-11-24 01:47:36,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2119019f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:36, skipping insertion in model container [2024-11-24 01:47:36,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:47:36" (1/1) ... [2024-11-24 01:47:36,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:47:36,522 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_6a5baa33-b04e-4201-abcf-fb359b361cb2/sv-benchmarks/c/eca-rers2012/Problem15_label00.c[1053,1066] [2024-11-24 01:47:37,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:47:37,175 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:47:37,194 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_6a5baa33-b04e-4201-abcf-fb359b361cb2/sv-benchmarks/c/eca-rers2012/Problem15_label00.c[1053,1066] [2024-11-24 01:47:37,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:47:37,574 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:47:37,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37 WrapperNode [2024-11-24 01:47:37,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:47:37,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:47:37,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:47:37,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:47:37,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:37,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:37,961 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1759 [2024-11-24 01:47:37,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:47:37,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:47:37,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:47:37,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:47:37,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:37,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,181 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-11-24 01:47:38,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:47:38,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:47:38,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:47:38,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:47:38,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (1/1) ... [2024-11-24 01:47:38,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:47:38,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:47:38,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:47:38,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:47:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:47:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:47:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:47:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:47:38,781 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:47:38,784 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:47:42,874 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-24 01:47:42,874 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:47:42,914 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:47:42,914 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:47:42,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:47:42 BoogieIcfgContainer [2024-11-24 01:47:42,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:47:42,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:47:42,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:47:42,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:47:42,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:47:36" (1/3) ... [2024-11-24 01:47:42,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d64fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:47:42, skipping insertion in model container [2024-11-24 01:47:42,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:47:37" (2/3) ... [2024-11-24 01:47:42,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d64fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:47:42, skipping insertion in model container [2024-11-24 01:47:42,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:47:42" (3/3) ... [2024-11-24 01:47:42,933 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label00.c [2024-11-24 01:47:42,952 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:47:42,954 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label00.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:47:43,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:47:43,089 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;@16d4dbe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:47:43,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:47:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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-11-24 01:47:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-24 01:47:43,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:47:43,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 01:47:43,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:47:43,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:47:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash 889694410, now seen corresponding path program 1 times [2024-11-24 01:47:43,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:47:43,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988186160] [2024-11-24 01:47:43,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:47:43,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:47:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:47:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:47:43,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:47:43,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988186160] [2024-11-24 01:47:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988186160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:47:43,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:47:43,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:47:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795506929] [2024-11-24 01:47:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:47:43,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:47:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:47:43,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:47:43,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:47:43,422 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-24 01:47:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:47:46,553 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2024-11-24 01:47:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:47:46,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-24 01:47:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:47:46,583 INFO L225 Difference]: With dead ends: 1154 [2024-11-24 01:47:46,584 INFO L226 Difference]: Without dead ends: 665 [2024-11-24 01:47:46,594 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-11-24 01:47:46,600 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 315 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:47:46,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 383 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-24 01:47:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-24 01:47:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2024-11-24 01:47:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 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-11-24 01:47:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2024-11-24 01:47:46,717 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 6 [2024-11-24 01:47:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:47:46,718 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2024-11-24 01:47:46,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-24 01:47:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2024-11-24 01:47:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-24 01:47:46,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:47:46,721 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-24 01:47:46,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:47:46,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:47:46,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:47:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash 393562629, now seen corresponding path program 1 times [2024-11-24 01:47:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:47:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003252887] [2024-11-24 01:47:46,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:47:46,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:47:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:47:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:47:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:47:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003252887] [2024-11-24 01:47:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003252887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:47:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:47:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:47:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538302188] [2024-11-24 01:47:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:47:47,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:47:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:47:47,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:47:47,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:47:47,451 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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-11-24 01:47:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:47:49,627 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2024-11-24 01:47:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:47:49,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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 71 [2024-11-24 01:47:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:47:49,635 INFO L225 Difference]: With dead ends: 1624 [2024-11-24 01:47:49,635 INFO L226 Difference]: Without dead ends: 963 [2024-11-24 01:47:49,637 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-11-24 01:47:49,639 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:47:49,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-24 01:47:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-24 01:47:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-24 01:47:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 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-11-24 01:47:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2024-11-24 01:47:49,693 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 71 [2024-11-24 01:47:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:47:49,693 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2024-11-24 01:47:49,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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-11-24 01:47:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2024-11-24 01:47:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-24 01:47:49,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:47:49,697 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-24 01:47:49,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:47:49,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:47:49,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:47:49,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1901777492, now seen corresponding path program 1 times [2024-11-24 01:47:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:47:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282308343] [2024-11-24 01:47:49,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:47:49,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:47:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:47:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:47:50,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:47:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282308343] [2024-11-24 01:47:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282308343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:47:50,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:47:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:47:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539859608] [2024-11-24 01:47:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:47:50,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:47:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:47:50,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:47:50,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:47:50,082 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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-11-24 01:47:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:47:52,856 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2024-11-24 01:47:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:47:52,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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 76 [2024-11-24 01:47:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:47:52,864 INFO L225 Difference]: With dead ends: 2229 [2024-11-24 01:47:52,865 INFO L226 Difference]: Without dead ends: 1567 [2024-11-24 01:47:52,866 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-11-24 01:47:52,867 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:47:52,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 316 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-24 01:47:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-24 01:47:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2024-11-24 01:47:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1265 states have internal predecessors, (1651), 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-11-24 01:47:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1651 transitions. [2024-11-24 01:47:52,908 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1651 transitions. Word has length 76 [2024-11-24 01:47:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:47:52,909 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1651 transitions. [2024-11-24 01:47:52,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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-11-24 01:47:52,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1651 transitions. [2024-11-24 01:47:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-24 01:47:52,912 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:47:52,912 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-24 01:47:52,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:47:52,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:47:52,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:47:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2146356330, now seen corresponding path program 1 times [2024-11-24 01:47:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:47:52,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270949752] [2024-11-24 01:47:52,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:47:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:47:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:47:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:47:53,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:47:53,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270949752] [2024-11-24 01:47:53,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270949752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:47:53,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:47:53,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:47:53,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400694311] [2024-11-24 01:47:53,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:47:53,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:47:53,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:47:53,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:47:53,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:47:53,205 INFO L87 Difference]: Start difference. First operand 1266 states and 1651 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 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-11-24 01:47:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:47:57,651 INFO L93 Difference]: Finished difference Result 4670 states and 6174 transitions. [2024-11-24 01:47:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:47:57,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 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 97 [2024-11-24 01:47:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:47:57,663 INFO L225 Difference]: With dead ends: 4670 [2024-11-24 01:47:57,663 INFO L226 Difference]: Without dead ends: 3406 [2024-11-24 01:47:57,665 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-11-24 01:47:57,666 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 557 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:47:57,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 376 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-24 01:47:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2024-11-24 01:47:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2024-11-24 01:47:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2372781065088758) internal successors, (4182), 3380 states have internal predecessors, (4182), 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-11-24 01:47:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4182 transitions. [2024-11-24 01:47:57,739 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4182 transitions. Word has length 97 [2024-11-24 01:47:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:47:57,739 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4182 transitions. [2024-11-24 01:47:57,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 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-11-24 01:47:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4182 transitions. [2024-11-24 01:47:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-24 01:47:57,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:47:57,743 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:47:57,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:47:57,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:47:57,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:47:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash -678485718, now seen corresponding path program 1 times [2024-11-24 01:47:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:47:57,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440706183] [2024-11-24 01:47:57,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:47:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:47:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:47:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-24 01:47:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:47:58,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440706183] [2024-11-24 01:47:58,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440706183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:47:58,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:47:58,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:47:58,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118991071] [2024-11-24 01:47:58,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:47:58,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:47:58,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:47:58,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:47:58,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:47:58,092 INFO L87 Difference]: Start difference. First operand 3381 states and 4182 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-11-24 01:47:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:47:59,900 INFO L93 Difference]: Finished difference Result 8563 states and 10760 transitions. [2024-11-24 01:47:59,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:47:59,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 163 [2024-11-24 01:47:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:47:59,919 INFO L225 Difference]: With dead ends: 8563 [2024-11-24 01:47:59,919 INFO L226 Difference]: Without dead ends: 5483 [2024-11-24 01:47:59,923 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-11-24 01:47:59,924 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:47:59,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-24 01:47:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2024-11-24 01:48:00,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2024-11-24 01:48:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1694358225305825) internal successors, (6405), 5477 states have internal predecessors, (6405), 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-11-24 01:48:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6405 transitions. [2024-11-24 01:48:00,067 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6405 transitions. Word has length 163 [2024-11-24 01:48:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:00,068 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6405 transitions. [2024-11-24 01:48:00,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-11-24 01:48:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6405 transitions. [2024-11-24 01:48:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-24 01:48:00,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:00,074 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-24 01:48:00,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 01:48:00,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:00,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 717405888, now seen corresponding path program 1 times [2024-11-24 01:48:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:00,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422826283] [2024-11-24 01:48:00,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:48:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422826283] [2024-11-24 01:48:00,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422826283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:48:00,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:48:00,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:48:00,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319089978] [2024-11-24 01:48:00,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:48:00,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:48:00,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:48:00,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:48:00,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:48:00,841 INFO L87 Difference]: Start difference. First operand 5478 states and 6405 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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-11-24 01:48:02,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:48:02,607 INFO L93 Difference]: Finished difference Result 10655 states and 12497 transitions. [2024-11-24 01:48:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:48:02,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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-11-24 01:48:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:48:02,623 INFO L225 Difference]: With dead ends: 10655 [2024-11-24 01:48:02,623 INFO L226 Difference]: Without dead ends: 5478 [2024-11-24 01:48:02,628 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-11-24 01:48:02,629 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 143 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:48:02,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-24 01:48:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2024-11-24 01:48:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2024-11-24 01:48:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 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-11-24 01:48:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2024-11-24 01:48:02,738 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 164 [2024-11-24 01:48:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:02,738 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2024-11-24 01:48:02,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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-11-24 01:48:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2024-11-24 01:48:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-24 01:48:02,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:02,741 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-24 01:48:02,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:48:02,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:02,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 456678259, now seen corresponding path program 1 times [2024-11-24 01:48:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043860099] [2024-11-24 01:48:02,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:48:03,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043860099] [2024-11-24 01:48:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043860099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:48:03,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:48:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:48:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441533395] [2024-11-24 01:48:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:48:03,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:48:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:48:03,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:48:03,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:48:03,050 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 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-11-24 01:48:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:48:06,429 INFO L93 Difference]: Finished difference Result 12184 states and 14319 transitions. [2024-11-24 01:48:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:48:06,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 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 182 [2024-11-24 01:48:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:48:06,443 INFO L225 Difference]: With dead ends: 12184 [2024-11-24 01:48:06,443 INFO L226 Difference]: Without dead ends: 7007 [2024-11-24 01:48:06,448 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-11-24 01:48:06,449 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 478 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:48:06,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 355 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-24 01:48:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7007 states. [2024-11-24 01:48:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7007 to 5786. [2024-11-24 01:48:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5786 states, 5785 states have (on average 1.1799481417458946) internal successors, (6826), 5785 states have internal predecessors, (6826), 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-11-24 01:48:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 6826 transitions. [2024-11-24 01:48:06,584 INFO L78 Accepts]: Start accepts. Automaton has 5786 states and 6826 transitions. Word has length 182 [2024-11-24 01:48:06,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:06,585 INFO L471 AbstractCegarLoop]: Abstraction has 5786 states and 6826 transitions. [2024-11-24 01:48:06,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 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-11-24 01:48:06,585 INFO L276 IsEmpty]: Start isEmpty. Operand 5786 states and 6826 transitions. [2024-11-24 01:48:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-24 01:48:06,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:06,589 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:48:06,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 01:48:06,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:06,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash -444310974, now seen corresponding path program 1 times [2024-11-24 01:48:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:06,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57795921] [2024-11-24 01:48:06,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:06,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:07,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:48:07,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57795921] [2024-11-24 01:48:07,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57795921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:48:07,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:48:07,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:48:07,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277041650] [2024-11-24 01:48:07,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:48:07,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:48:07,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:48:07,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:48:07,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:48:07,157 INFO L87 Difference]: Start difference. First operand 5786 states and 6826 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 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-11-24 01:48:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:48:10,721 INFO L93 Difference]: Finished difference Result 13094 states and 15499 transitions. [2024-11-24 01:48:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:48:10,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 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 239 [2024-11-24 01:48:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:48:10,744 INFO L225 Difference]: With dead ends: 13094 [2024-11-24 01:48:10,744 INFO L226 Difference]: Without dead ends: 7609 [2024-11-24 01:48:10,750 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-11-24 01:48:10,750 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 427 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:48:10,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 361 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-24 01:48:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7609 states. [2024-11-24 01:48:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 6086. [2024-11-24 01:48:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 6085 states have (on average 1.1750205423171733) internal successors, (7150), 6085 states have internal predecessors, (7150), 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-11-24 01:48:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 7150 transitions. [2024-11-24 01:48:10,865 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 7150 transitions. Word has length 239 [2024-11-24 01:48:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 6086 states and 7150 transitions. [2024-11-24 01:48:10,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 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-11-24 01:48:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 7150 transitions. [2024-11-24 01:48:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-24 01:48:10,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:10,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-24 01:48:10,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:48:10,872 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:10,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1593338374, now seen corresponding path program 1 times [2024-11-24 01:48:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825218680] [2024-11-24 01:48:10,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-24 01:48:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:48:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825218680] [2024-11-24 01:48:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825218680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:48:11,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:48:11,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:48:11,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471627253] [2024-11-24 01:48:11,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:48:11,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:48:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:48:11,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:48:11,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:48:11,449 INFO L87 Difference]: Start difference. First operand 6086 states and 7150 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-11-24 01:48:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:48:13,637 INFO L93 Difference]: Finished difference Result 14273 states and 17120 transitions. [2024-11-24 01:48:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:48:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 293 [2024-11-24 01:48:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:48:13,656 INFO L225 Difference]: With dead ends: 14273 [2024-11-24 01:48:13,656 INFO L226 Difference]: Without dead ends: 8488 [2024-11-24 01:48:13,660 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-11-24 01:48:13,661 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 310 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:48:13,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-24 01:48:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8488 states. [2024-11-24 01:48:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8488 to 8484. [2024-11-24 01:48:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8484 states, 8483 states have (on average 1.1478250618884829) internal successors, (9737), 8483 states have internal predecessors, (9737), 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-11-24 01:48:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 9737 transitions. [2024-11-24 01:48:13,761 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 9737 transitions. Word has length 293 [2024-11-24 01:48:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:13,762 INFO L471 AbstractCegarLoop]: Abstraction has 8484 states and 9737 transitions. [2024-11-24 01:48:13,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-11-24 01:48:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 9737 transitions. [2024-11-24 01:48:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-24 01:48:13,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:13,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-24 01:48:13,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 01:48:13,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:13,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash -803643897, now seen corresponding path program 1 times [2024-11-24 01:48:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:13,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673752501] [2024-11-24 01:48:13,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-24 01:48:14,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:48:14,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673752501] [2024-11-24 01:48:14,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673752501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:48:14,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:48:14,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:48:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100926287] [2024-11-24 01:48:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:48:14,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:48:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:48:14,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:48:14,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:48:14,262 INFO L87 Difference]: Start difference. First operand 8484 states and 9737 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-11-24 01:48:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:48:16,662 INFO L93 Difference]: Finished difference Result 19663 states and 22941 transitions. [2024-11-24 01:48:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:48:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 352 [2024-11-24 01:48:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:48:16,691 INFO L225 Difference]: With dead ends: 19663 [2024-11-24 01:48:16,692 INFO L226 Difference]: Without dead ends: 11480 [2024-11-24 01:48:16,699 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-11-24 01:48:16,700 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 321 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:48:16,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-24 01:48:16,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11480 states. [2024-11-24 01:48:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11480 to 10583. [2024-11-24 01:48:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10583 states, 10582 states have (on average 1.1332451332451332) internal successors, (11992), 10582 states have internal predecessors, (11992), 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-11-24 01:48:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 11992 transitions. [2024-11-24 01:48:16,849 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 11992 transitions. Word has length 352 [2024-11-24 01:48:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:16,850 INFO L471 AbstractCegarLoop]: Abstraction has 10583 states and 11992 transitions. [2024-11-24 01:48:16,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-11-24 01:48:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 11992 transitions. [2024-11-24 01:48:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-24 01:48:16,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:16,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:48:16,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:48:16,858 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:16,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash -902711679, now seen corresponding path program 1 times [2024-11-24 01:48:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439500248] [2024-11-24 01:48:16,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:48:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439500248] [2024-11-24 01:48:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439500248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:48:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513303705] [2024-11-24 01:48:18,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:48:18,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:48:18,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:48:18,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:48:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:18,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-24 01:48:18,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:48:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:19,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:48:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:25,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513303705] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 01:48:25,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:48:25,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2024-11-24 01:48:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063003755] [2024-11-24 01:48:25,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:48:25,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:48:25,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:48:25,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:48:25,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:48:25,746 INFO L87 Difference]: Start difference. First operand 10583 states and 11992 transitions. Second operand has 5 states, 5 states have (on average 70.6) internal successors, (353), 4 states have internal predecessors, (353), 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-11-24 01:48:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:48:32,144 INFO L93 Difference]: Finished difference Result 26294 states and 30187 transitions. [2024-11-24 01:48:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:48:32,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 4 states have internal predecessors, (353), 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 353 [2024-11-24 01:48:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:48:32,181 INFO L225 Difference]: With dead ends: 26294 [2024-11-24 01:48:32,181 INFO L226 Difference]: Without dead ends: 16012 [2024-11-24 01:48:32,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 700 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:48:32,190 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 684 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:48:32,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 117 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-24 01:48:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16012 states. [2024-11-24 01:48:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16012 to 11484. [2024-11-24 01:48:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11484 states, 11483 states have (on average 1.1698162501088565) internal successors, (13433), 11483 states have internal predecessors, (13433), 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-11-24 01:48:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11484 states to 11484 states and 13433 transitions. [2024-11-24 01:48:32,368 INFO L78 Accepts]: Start accepts. Automaton has 11484 states and 13433 transitions. Word has length 353 [2024-11-24 01:48:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:32,369 INFO L471 AbstractCegarLoop]: Abstraction has 11484 states and 13433 transitions. [2024-11-24 01:48:32,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 4 states have internal predecessors, (353), 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-11-24 01:48:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11484 states and 13433 transitions. [2024-11-24 01:48:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-24 01:48:32,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:32,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-24 01:48:32,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 01:48:32,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-24 01:48:32,578 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:32,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:32,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1625402866, now seen corresponding path program 1 times [2024-11-24 01:48:32,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:32,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614418804] [2024-11-24 01:48:32,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:48:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614418804] [2024-11-24 01:48:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614418804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:48:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:48:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:48:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469442589] [2024-11-24 01:48:33,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:48:33,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:48:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:48:33,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:48:33,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:48:33,011 INFO L87 Difference]: Start difference. First operand 11484 states and 13433 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-11-24 01:48:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:48:35,245 INFO L93 Difference]: Finished difference Result 25666 states and 30681 transitions. [2024-11-24 01:48:35,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:48:35,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 369 [2024-11-24 01:48:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:48:35,291 INFO L225 Difference]: With dead ends: 25666 [2024-11-24 01:48:35,291 INFO L226 Difference]: Without dead ends: 14483 [2024-11-24 01:48:35,308 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-11-24 01:48:35,309 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:48:35,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-24 01:48:35,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14483 states. [2024-11-24 01:48:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14483 to 13578. [2024-11-24 01:48:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13578 states, 13577 states have (on average 1.1612285482801796) internal successors, (15766), 13577 states have internal predecessors, (15766), 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-11-24 01:48:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13578 states to 13578 states and 15766 transitions. [2024-11-24 01:48:35,513 INFO L78 Accepts]: Start accepts. Automaton has 13578 states and 15766 transitions. Word has length 369 [2024-11-24 01:48:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:35,515 INFO L471 AbstractCegarLoop]: Abstraction has 13578 states and 15766 transitions. [2024-11-24 01:48:35,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-11-24 01:48:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 13578 states and 15766 transitions. [2024-11-24 01:48:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2024-11-24 01:48:35,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:35,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:48:35,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 01:48:35,520 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:35,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash -595863620, now seen corresponding path program 1 times [2024-11-24 01:48:35,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:35,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086271993] [2024-11-24 01:48:35,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-24 01:48:35,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:48:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086271993] [2024-11-24 01:48:35,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086271993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:48:35,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:48:35,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:48:35,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982060109] [2024-11-24 01:48:35,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:48:35,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:48:35,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:48:35,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:48:35,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:48:35,928 INFO L87 Difference]: Start difference. First operand 13578 states and 15766 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-11-24 01:48:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:48:38,071 INFO L93 Difference]: Finished difference Result 34647 states and 40388 transitions. [2024-11-24 01:48:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:48:38,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 415 [2024-11-24 01:48:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:48:38,092 INFO L225 Difference]: With dead ends: 34647 [2024-11-24 01:48:38,092 INFO L226 Difference]: Without dead ends: 21370 [2024-11-24 01:48:38,102 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-11-24 01:48:38,104 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 321 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:48:38,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 622 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-24 01:48:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21370 states. [2024-11-24 01:48:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21370 to 21056. [2024-11-24 01:48:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21056 states, 21055 states have (on average 1.1328900498693897) internal successors, (23853), 21055 states have internal predecessors, (23853), 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-11-24 01:48:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21056 states to 21056 states and 23853 transitions. [2024-11-24 01:48:38,385 INFO L78 Accepts]: Start accepts. Automaton has 21056 states and 23853 transitions. Word has length 415 [2024-11-24 01:48:38,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:38,386 INFO L471 AbstractCegarLoop]: Abstraction has 21056 states and 23853 transitions. [2024-11-24 01:48:38,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-11-24 01:48:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 21056 states and 23853 transitions. [2024-11-24 01:48:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-24 01:48:38,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:38,392 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:48:38,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 01:48:38,393 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:38,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:38,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1371943525, now seen corresponding path program 1 times [2024-11-24 01:48:38,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:38,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519230094] [2024-11-24 01:48:38,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:38,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:39,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:48:39,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519230094] [2024-11-24 01:48:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519230094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:48:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645300837] [2024-11-24 01:48:39,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:39,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:48:39,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:48:39,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:48:39,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:48:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:48:39,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 01:48:39,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:48:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:41,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:48:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 85 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:48:42,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645300837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:48:42,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:48:42,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-24 01:48:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328148644] [2024-11-24 01:48:42,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:48:42,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 01:48:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:48:42,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 01:48:42,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:48:42,326 INFO L87 Difference]: Start difference. First operand 21056 states and 23853 transitions. Second operand has 13 states, 13 states have (on average 85.23076923076923) internal successors, (1108), 12 states have internal predecessors, (1108), 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-11-24 01:48:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:48:57,151 INFO L93 Difference]: Finished difference Result 85654 states and 97312 transitions. [2024-11-24 01:48:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:48:57,152 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 85.23076923076923) internal successors, (1108), 12 states have internal predecessors, (1108), 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 460 [2024-11-24 01:48:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:48:57,204 INFO L225 Difference]: With dead ends: 85654 [2024-11-24 01:48:57,204 INFO L226 Difference]: Without dead ends: 64899 [2024-11-24 01:48:57,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 912 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-11-24 01:48:57,215 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 7295 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 5569 mSolverCounterSat, 5710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7295 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 11279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5710 IncrementalHoareTripleChecker+Valid, 5569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:48:57,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7295 Valid, 216 Invalid, 11279 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5710 Valid, 5569 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2024-11-24 01:48:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64899 states. [2024-11-24 01:48:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64899 to 28249. [2024-11-24 01:48:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28249 states, 28248 states have (on average 1.14517841971113) internal successors, (32349), 28248 states have internal predecessors, (32349), 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-11-24 01:48:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28249 states to 28249 states and 32349 transitions. [2024-11-24 01:48:57,966 INFO L78 Accepts]: Start accepts. Automaton has 28249 states and 32349 transitions. Word has length 460 [2024-11-24 01:48:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:48:57,967 INFO L471 AbstractCegarLoop]: Abstraction has 28249 states and 32349 transitions. [2024-11-24 01:48:57,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.23076923076923) internal successors, (1108), 12 states have internal predecessors, (1108), 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-11-24 01:48:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 28249 states and 32349 transitions. [2024-11-24 01:48:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-11-24 01:48:57,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:48:57,977 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-24 01:48:57,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 01:48:58,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:48:58,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:48:58,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1741666877, now seen corresponding path program 1 times [2024-11-24 01:48:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:58,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709859891] [2024-11-24 01:48:58,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:48:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 83 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:49:00,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:49:00,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709859891] [2024-11-24 01:49:00,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709859891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:49:00,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947280408] [2024-11-24 01:49:00,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:00,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:49:00,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:49:00,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:49:00,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:49:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:00,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 01:49:00,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:49:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-24 01:49:02,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:49:02,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947280408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:49:02,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:49:02,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-24 01:49:02,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23851155] [2024-11-24 01:49:02,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:49:02,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:49:02,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:49:02,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:49:02,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:49:02,511 INFO L87 Difference]: Start difference. First operand 28249 states and 32349 transitions. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-11-24 01:49:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:49:04,539 INFO L93 Difference]: Finished difference Result 68159 states and 78340 transitions. [2024-11-24 01:49:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:49:04,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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 483 [2024-11-24 01:49:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:49:04,576 INFO L225 Difference]: With dead ends: 68159 [2024-11-24 01:49:04,576 INFO L226 Difference]: Without dead ends: 40211 [2024-11-24 01:49:04,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:49:04,592 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 279 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:49:04,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 191 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-24 01:49:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40211 states. [2024-11-24 01:49:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40211 to 31234. [2024-11-24 01:49:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31234 states, 31233 states have (on average 1.1592546345211796) internal successors, (36207), 31233 states have internal predecessors, (36207), 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-11-24 01:49:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31234 states to 31234 states and 36207 transitions. [2024-11-24 01:49:05,099 INFO L78 Accepts]: Start accepts. Automaton has 31234 states and 36207 transitions. Word has length 483 [2024-11-24 01:49:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:49:05,100 INFO L471 AbstractCegarLoop]: Abstraction has 31234 states and 36207 transitions. [2024-11-24 01:49:05,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-11-24 01:49:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 31234 states and 36207 transitions. [2024-11-24 01:49:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-24 01:49:05,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:49:05,108 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-24 01:49:05,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 01:49:05,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-24 01:49:05,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:49:05,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:49:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash 563793329, now seen corresponding path program 1 times [2024-11-24 01:49:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:49:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219024792] [2024-11-24 01:49:05,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:49:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 344 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 01:49:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:49:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219024792] [2024-11-24 01:49:06,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219024792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:49:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025401241] [2024-11-24 01:49:06,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:06,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:49:06,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:49:06,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:49:06,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 01:49:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:06,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-24 01:49:06,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:49:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 344 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 01:49:07,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:49:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 344 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 01:49:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025401241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:49:08,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:49:08,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-24 01:49:08,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051535213] [2024-11-24 01:49:08,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:49:08,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 01:49:08,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:49:08,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 01:49:08,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:49:08,464 INFO L87 Difference]: Start difference. First operand 31234 states and 36207 transitions. Second operand has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 8 states have internal predecessors, (776), 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-11-24 01:49:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:49:15,711 INFO L93 Difference]: Finished difference Result 69949 states and 80638 transitions. [2024-11-24 01:49:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:49:15,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 8 states have internal predecessors, (776), 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 491 [2024-11-24 01:49:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:49:15,736 INFO L225 Difference]: With dead ends: 69949 [2024-11-24 01:49:15,736 INFO L226 Difference]: Without dead ends: 29435 [2024-11-24 01:49:15,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 991 GetRequests, 977 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:49:15,750 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 3272 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 5615 mSolverCounterSat, 741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3272 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 6356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 5615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:49:15,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3272 Valid, 239 Invalid, 6356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 5615 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-24 01:49:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29435 states. [2024-11-24 01:49:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29435 to 25231. [2024-11-24 01:49:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25231 states, 25230 states have (on average 1.0751486325802615) internal successors, (27126), 25230 states have internal predecessors, (27126), 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-11-24 01:49:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25231 states to 25231 states and 27126 transitions. [2024-11-24 01:49:16,144 INFO L78 Accepts]: Start accepts. Automaton has 25231 states and 27126 transitions. Word has length 491 [2024-11-24 01:49:16,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:49:16,144 INFO L471 AbstractCegarLoop]: Abstraction has 25231 states and 27126 transitions. [2024-11-24 01:49:16,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 8 states have internal predecessors, (776), 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-11-24 01:49:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 25231 states and 27126 transitions. [2024-11-24 01:49:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-11-24 01:49:16,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:49:16,149 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:49:16,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-24 01:49:16,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-24 01:49:16,350 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:49:16,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:49:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1441150413, now seen corresponding path program 1 times [2024-11-24 01:49:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:49:16,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006400559] [2024-11-24 01:49:16,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:16,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:49:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-24 01:49:16,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:49:16,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006400559] [2024-11-24 01:49:16,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006400559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:49:16,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:49:16,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:49:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783174607] [2024-11-24 01:49:16,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:49:16,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:49:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:49:16,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:49:16,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:49:16,636 INFO L87 Difference]: Start difference. First operand 25231 states and 27126 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-11-24 01:49:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:49:18,055 INFO L93 Difference]: Finished difference Result 50457 states and 54259 transitions. [2024-11-24 01:49:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:49:18,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 507 [2024-11-24 01:49:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:49:18,090 INFO L225 Difference]: With dead ends: 50457 [2024-11-24 01:49:18,091 INFO L226 Difference]: Without dead ends: 25527 [2024-11-24 01:49:18,104 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-11-24 01:49:18,105 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:49:18,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 01:49:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25527 states. [2024-11-24 01:49:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25527 to 25227. [2024-11-24 01:49:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25227 states, 25226 states have (on average 1.0750416237215572) internal successors, (27119), 25226 states have internal predecessors, (27119), 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-11-24 01:49:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25227 states to 25227 states and 27119 transitions. [2024-11-24 01:49:18,546 INFO L78 Accepts]: Start accepts. Automaton has 25227 states and 27119 transitions. Word has length 507 [2024-11-24 01:49:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:49:18,547 INFO L471 AbstractCegarLoop]: Abstraction has 25227 states and 27119 transitions. [2024-11-24 01:49:18,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-11-24 01:49:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 25227 states and 27119 transitions. [2024-11-24 01:49:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2024-11-24 01:49:18,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:49:18,559 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-24 01:49:18,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 01:49:18,560 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:49:18,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:49:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1546891992, now seen corresponding path program 1 times [2024-11-24 01:49:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:49:18,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058157495] [2024-11-24 01:49:18,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:49:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 8 proven. 207 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-11-24 01:49:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:49:19,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058157495] [2024-11-24 01:49:19,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058157495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:49:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231041977] [2024-11-24 01:49:19,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:19,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:49:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:49:19,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:49:19,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 01:49:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:20,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 01:49:20,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:49:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-11-24 01:49:20,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:49:20,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231041977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:49:20,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:49:20,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-24 01:49:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555340432] [2024-11-24 01:49:20,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:49:20,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:49:20,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:49:20,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:49:20,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:49:20,332 INFO L87 Difference]: Start difference. First operand 25227 states and 27119 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-11-24 01:49:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:49:21,704 INFO L93 Difference]: Finished difference Result 49849 states and 53603 transitions. [2024-11-24 01:49:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:49:21,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 631 [2024-11-24 01:49:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:49:21,725 INFO L225 Difference]: With dead ends: 49849 [2024-11-24 01:49:21,725 INFO L226 Difference]: Without dead ends: 24624 [2024-11-24 01:49:21,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 632 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-11-24 01:49:21,737 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 321 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:49:21,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 515 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 01:49:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24624 states. [2024-11-24 01:49:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24624 to 24025. [2024-11-24 01:49:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24025 states, 24024 states have (on average 1.0416250416250417) internal successors, (25024), 24024 states have internal predecessors, (25024), 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-11-24 01:49:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24025 states to 24025 states and 25024 transitions. [2024-11-24 01:49:21,975 INFO L78 Accepts]: Start accepts. Automaton has 24025 states and 25024 transitions. Word has length 631 [2024-11-24 01:49:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:49:21,976 INFO L471 AbstractCegarLoop]: Abstraction has 24025 states and 25024 transitions. [2024-11-24 01:49:21,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-11-24 01:49:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 24025 states and 25024 transitions. [2024-11-24 01:49:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2024-11-24 01:49:21,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:49:21,982 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-24 01:49:21,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 01:49:22,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-24 01:49:22,182 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:49:22,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:49:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1195178063, now seen corresponding path program 1 times [2024-11-24 01:49:22,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:49:22,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680805021] [2024-11-24 01:49:22,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:49:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2024-11-24 01:49:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:49:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680805021] [2024-11-24 01:49:22,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680805021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:49:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:49:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:49:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648815160] [2024-11-24 01:49:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:49:22,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:49:22,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:49:22,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:49:22,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:49:22,522 INFO L87 Difference]: Start difference. First operand 24025 states and 25024 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-11-24 01:49:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:49:23,881 INFO L93 Difference]: Finished difference Result 51336 states and 53485 transitions. [2024-11-24 01:49:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:49:23,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-11-24 01:49:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:49:23,911 INFO L225 Difference]: With dead ends: 51336 [2024-11-24 01:49:23,911 INFO L226 Difference]: Without dead ends: 27612 [2024-11-24 01:49:23,922 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-11-24 01:49:23,923 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 401 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:49:23,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 421 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 01:49:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27612 states. [2024-11-24 01:49:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27612 to 24024. [2024-11-24 01:49:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24024 states, 24023 states have (on average 1.0410023727261375) internal successors, (25008), 24023 states have internal predecessors, (25008), 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-11-24 01:49:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24024 states to 24024 states and 25008 transitions. [2024-11-24 01:49:24,158 INFO L78 Accepts]: Start accepts. Automaton has 24024 states and 25008 transitions. Word has length 634 [2024-11-24 01:49:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:49:24,159 INFO L471 AbstractCegarLoop]: Abstraction has 24024 states and 25008 transitions. [2024-11-24 01:49:24,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-11-24 01:49:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 24024 states and 25008 transitions. [2024-11-24 01:49:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2024-11-24 01:49:24,164 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:49:24,164 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-24 01:49:24,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 01:49:24,164 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:49:24,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:49:24,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1016238691, now seen corresponding path program 1 times [2024-11-24 01:49:24,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:49:24,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461638965] [2024-11-24 01:49:24,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:24,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:49:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 365 proven. 188 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-24 01:49:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:49:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461638965] [2024-11-24 01:49:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461638965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:49:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355499294] [2024-11-24 01:49:25,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:25,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:49:25,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:49:25,498 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:49:25,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 01:49:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:25,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-24 01:49:25,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:49:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 365 proven. 188 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-24 01:49:27,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:49:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 365 proven. 188 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-24 01:49:32,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355499294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:49:32,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:49:32,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-24 01:49:32,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220170006] [2024-11-24 01:49:32,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:49:32,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 01:49:32,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:49:32,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 01:49:32,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:49:32,483 INFO L87 Difference]: Start difference. First operand 24024 states and 25008 transitions. Second operand has 9 states, 9 states have (on average 158.11111111111111) internal successors, (1423), 8 states have internal predecessors, (1423), 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-11-24 01:49:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:49:38,833 INFO L93 Difference]: Finished difference Result 60966 states and 63493 transitions. [2024-11-24 01:49:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:49:38,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 158.11111111111111) internal successors, (1423), 8 states have internal predecessors, (1423), 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 647 [2024-11-24 01:49:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:49:38,967 INFO L225 Difference]: With dead ends: 60966 [2024-11-24 01:49:38,967 INFO L226 Difference]: Without dead ends: 37243 [2024-11-24 01:49:38,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1303 GetRequests, 1289 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:49:38,973 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1292 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 5224 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 5815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 5224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:49:38,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 220 Invalid, 5815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 5224 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-24 01:49:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37243 states. [2024-11-24 01:49:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37243 to 27317. [2024-11-24 01:49:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27317 states, 27316 states have (on average 1.041697173817543) internal successors, (28455), 27316 states have internal predecessors, (28455), 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-11-24 01:49:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27317 states to 27317 states and 28455 transitions. [2024-11-24 01:49:39,288 INFO L78 Accepts]: Start accepts. Automaton has 27317 states and 28455 transitions. Word has length 647 [2024-11-24 01:49:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:49:39,289 INFO L471 AbstractCegarLoop]: Abstraction has 27317 states and 28455 transitions. [2024-11-24 01:49:39,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.11111111111111) internal successors, (1423), 8 states have internal predecessors, (1423), 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-11-24 01:49:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 27317 states and 28455 transitions. [2024-11-24 01:49:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2024-11-24 01:49:39,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:49:39,294 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-24 01:49:39,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-24 01:49:39,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-24 01:49:39,495 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:49:39,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:49:39,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1527938514, now seen corresponding path program 1 times [2024-11-24 01:49:39,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:49:39,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632157146] [2024-11-24 01:49:39,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:49:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 11 proven. 464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:49:40,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:49:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632157146] [2024-11-24 01:49:40,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632157146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:49:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501550256] [2024-11-24 01:49:40,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:40,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:49:40,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:49:40,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:49:40,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 01:49:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:49:41,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 01:49:41,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:49:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:49:42,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:49:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:49:45,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501550256] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 01:49:45,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:49:45,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2024-11-24 01:49:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537040710] [2024-11-24 01:49:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:49:45,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:49:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:49:45,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:49:45,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:49:45,890 INFO L87 Difference]: Start difference. First operand 27317 states and 28455 transitions. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 5 states have internal predecessors, (647), 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-11-24 01:49:50,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:49:54,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:49:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:49:55,561 INFO L93 Difference]: Finished difference Result 60054 states and 62576 transitions. [2024-11-24 01:49:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:49:55,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 5 states have internal predecessors, (647), 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 647 [2024-11-24 01:49:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:49:55,598 INFO L225 Difference]: With dead ends: 60054 [2024-11-24 01:49:55,598 INFO L226 Difference]: Without dead ends: 32739 [2024-11-24 01:49:55,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1297 GetRequests, 1285 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:49:55,613 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 942 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 725 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 725 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:49:55,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 106 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [725 Valid, 2195 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-11-24 01:49:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32739 states. [2024-11-24 01:49:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32739 to 24624. [2024-11-24 01:49:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24624 states, 24623 states have (on average 1.043089794094952) internal successors, (25684), 24623 states have internal predecessors, (25684), 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-11-24 01:49:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24624 states to 24624 states and 25684 transitions. [2024-11-24 01:49:55,909 INFO L78 Accepts]: Start accepts. Automaton has 24624 states and 25684 transitions. Word has length 647 [2024-11-24 01:49:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:49:55,909 INFO L471 AbstractCegarLoop]: Abstraction has 24624 states and 25684 transitions. [2024-11-24 01:49:55,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 5 states have internal predecessors, (647), 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-11-24 01:49:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 24624 states and 25684 transitions. [2024-11-24 01:49:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2024-11-24 01:49:55,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:49:55,915 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-24 01:49:55,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-24 01:49:56,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-24 01:49:56,115 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:49:56,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:49:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1089109601, now seen corresponding path program 1 times [2024-11-24 01:49:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:49:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656132419] [2024-11-24 01:49:56,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:49:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:49:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:49:56,217 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:49:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:49:56,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:49:56,524 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:49:56,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:49:56,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-24 01:49:56,531 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] [2024-11-24 01:49:56,743 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:49:56,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:49:56 BoogieIcfgContainer [2024-11-24 01:49:56,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:49:56,748 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:49:56,748 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:49:56,748 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:49:56,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:47:42" (3/4) ... [2024-11-24 01:49:56,752 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-24 01:49:57,126 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 656. [2024-11-24 01:49:57,402 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-24 01:49:57,403 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-24 01:49:57,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:49:57,404 INFO L158 Benchmark]: Toolchain (without parser) took 141220.41ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 87.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 353.1MB. Max. memory is 16.1GB. [2024-11-24 01:49:57,404 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:49:57,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1392.85ms. Allocated memory is still 117.4MB. Free memory was 87.0MB in the beginning and 62.8MB in the end (delta: 24.2MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-11-24 01:49:57,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 383.68ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 63.2MB in the end (delta: -409.8kB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-11-24 01:49:57,405 INFO L158 Benchmark]: Boogie Preprocessor took 645.97ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 63.2MB in the beginning and 162.0MB in the end (delta: -98.8MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-11-24 01:49:57,405 INFO L158 Benchmark]: RCFGBuilder took 4304.18ms. Allocated memory is still 226.5MB. Free memory was 162.0MB in the beginning and 92.1MB in the end (delta: 69.9MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2024-11-24 01:49:57,405 INFO L158 Benchmark]: TraceAbstraction took 133826.06ms. Allocated memory was 226.5MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 90.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-24 01:49:57,406 INFO L158 Benchmark]: Witness Printer took 655.14ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 71.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-24 01:49:57,407 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.47ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1392.85ms. Allocated memory is still 117.4MB. Free memory was 87.0MB in the beginning and 62.8MB in the end (delta: 24.2MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 383.68ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 63.2MB in the end (delta: -409.8kB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 645.97ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 63.2MB in the beginning and 162.0MB in the end (delta: -98.8MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * RCFGBuilder took 4304.18ms. Allocated memory is still 226.5MB. Free memory was 162.0MB in the beginning and 92.1MB in the end (delta: 69.9MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. * TraceAbstraction took 133826.06ms. Allocated memory was 226.5MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 90.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 655.14ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 71.3MB). Peak memory consumption was 67.1MB. 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: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputA = 1; [L22] int inputF = 6; [L23] int inputC = 3; [L26] int a4 = -89; [L27] int a29 = -127; [L28] int a2 = 1; [L29] int a0 = -44; VAL [a0=-44, a29=-127, a2=1, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1773] int output = -1; VAL [a0=-44, a29=-127, a2=1, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL, EXPR calculate_output(input) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND FALSE !(( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1045] COND FALSE !(((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1048] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4))) || ((a2==4) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (( a0 <= -147 && ((a2==5) && (input == 1))) && 43 < a29 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1059] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !((((a2==2) && (((input == 4) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1084] COND FALSE !((((((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( a4 <= -86 && (((input == 6) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1096] COND FALSE !(((a2==1) && (( 43 < a29 && ((input == 2) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1101] COND FALSE !((((((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1108] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !(((a2==2) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1125] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1132] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && (a2==5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1138] COND FALSE !(( 43 < a29 && ( a4 <= -86 && ( -61 < a0 && ((a2==3) && (input == 3)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1144] COND FALSE !((((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) ) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 ))) && (input == 1))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1160] COND FALSE !(((a2==4) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1166] COND FALSE !(((a2==4) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1172] COND FALSE !((((a2==4) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1178] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( 43 < a29 && ((input == 3) && (a2==1)))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1182] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1188] COND FALSE !(( a0 <= -147 && (((((a2==2) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2)))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1194] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 2) && (a2==2))) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1200] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 2)) && a29 <= -144 ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1207] COND FALSE !((((a2==5) && ( -61 < a0 && ((input == 5) && 43 < a29 ))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1213] COND FALSE !((((( a0 <= -147 && (input == 6)) && (a2==5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1218] COND FALSE !(( 43 < a29 && ((((input == 4) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1222] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && ((a2==1) && ((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1228] COND FALSE !(( -61 < a0 && (((input == 1) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2)))) && a4 <= -86 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1234] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1241] COND FALSE !(((a2==3) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1247] COND FALSE !(( -61 < a0 && ((((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 2)) && a4 <= -86 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1253] COND FALSE !(((((input == 1) && (( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !(((( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && (input == 3))) && (a2==5)) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 5)) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1271] COND FALSE !(((a2==2) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1274] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && (input == 2))) && (a2==5)) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1281] COND FALSE !((( -61 < a0 && ((input == 5) && ((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1287] COND FALSE !(((a2==1) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1293] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1299] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ( 43 < a29 && (((a2==2) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1310] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1316] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4))) && (a2==3)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1323] COND FALSE !(((a2==1) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1327] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==1))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1331] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1343] COND FALSE !((( a0 <= -147 && (((input == 1) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1348] COND FALSE !((( -61 < a0 && ((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 6))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1354] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((a2==5) && (((input == 4) && ( 43 < a29 || ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1360] COND FALSE !((( a0 <= -147 && (((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1369] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1375] COND FALSE !((((((input == 6) && a29 <= -144 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1381] COND FALSE !((((((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1388] COND FALSE !(( -61 < a0 && (((a2==3) && ( a4 <= -86 && (input == 1))) && 43 < a29 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1395] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && (a2==5))) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1398] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4)))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1404] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1418] COND FALSE !(( a4 <= -86 && ((((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 4)) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1423] COND FALSE !((((a2==3) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1429] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && (((a2==3) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1441] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ( ((-144 < a29) && (-16 >= a29)) && (input == 5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1448] COND FALSE !(((((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 ))) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1459] COND FALSE !(((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1466] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 1)) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1471] COND FALSE !(((a2==2) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1476] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1483] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1488] COND FALSE !((((((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1492] COND FALSE !((( a0 <= -147 && ((input == 3) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1498] COND FALSE !(( -61 < a0 && (((input == 4) && (( ((-144 < a29) && (-16 >= a29)) && (a2==5)) || (((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )))) && a4 <= -86 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1504] COND FALSE !(((a2==4) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1511] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && (a2==4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1518] COND FALSE !((((( ((-86 < a4) && (-42 >= a4)) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==2)) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1521] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && (( 43 < a29 && (input == 1)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1526] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1532] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1538] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1543] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 3)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1550] COND FALSE !(( a0 <= -147 && ((((a2==1) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1557] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ((input == 2) && ((-86 < a4) && (-42 >= a4)) ))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1564] COND FALSE !((((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && a4 <= -86 )) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1569] COND FALSE !(((a2==4) && (( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1576] COND FALSE !((( a0 <= -147 && (((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(( a4 <= -86 && (((((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))) && (input == 4)) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(( ((-144 < a29) && (-16 >= a29)) && ((a2==2) && (( ((-86 < a4) && (-42 >= a4)) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1599] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && (a2==4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1605] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1612] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ( ((-86 < a4) && (-42 >= a4)) && (input == 2))) && a0 <= -147 ) && (a2==1))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1616] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) && (input == 3)) && (a2==2))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1622] COND FALSE !(((a2==3) && ( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1633] COND FALSE !(( a4 <= -86 && (( -61 < a0 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 6))) && (a2==4)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1639] COND FALSE !(( a4 <= -86 && ( ((-16 < a29) && (43 >= a29)) && (( -61 < a0 && (input == 2)) && (a2==5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1645] COND TRUE (((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && a4 <= -86 )) && -61 < a0 ) [L1646] a29 = (((a29 / 5) / 5) + 4459) [L1647] a2 = 2 [L1649] return 22; VAL [\result=22, a0=-44, a29=4454, a2=2, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] RET, EXPR calculate_output(input) [L1784] output = calculate_output(input) [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL, EXPR calculate_output(input) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND TRUE ( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 )) [L1041] a29 = ((((a29 + 0) + 0) % 29)+ 14) [L1042] a2 = 4 [L1044] return 22; VAL [\result=22, a0=-44, a29=31, a2=4, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] RET, EXPR calculate_output(input) [L1784] output = calculate_output(input) [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL, EXPR calculate_output(input) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND TRUE ((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=31, a2=4, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(43 < a29) [L324] a4 = ((((a4 % 21)+ -46) * 1) + -5) [L325] a0 = ((((a0 + 0) % 299926)+ -300072) * 1) [L326] a29 = ((((a29 + 371124) % 29)- -13) + 2) [L327] a2 = 3 VAL [a0=-300116, a29=28, a2=3, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] return 22; VAL [\result=22, a0=-300116, a29=28, a2=3, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] RET, EXPR calculate_output(input) [L1784] output = calculate_output(input) [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL, EXPR calculate_output(input) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND TRUE ((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ) [L450] a4 = (((a4 + -287863) + -192250) * 1) [L451] a29 = ((((a29 / 5) % 63)+ -80) - 1) [L452] a2 = 1 [L454] return -1; VAL [\result=-1, a0=-300116, a29=-76, a2=1, a4=-480169, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] RET, EXPR calculate_output(input) [L1784] output = calculate_output(input) [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL calculate_output(input) [L34] COND TRUE ((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) ) VAL [a0=-300116, a29=-76, a2=1, a4=-480169, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] reach_error() VAL [a0=-300116, a29=-76, a2=1, a4=-480169, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 133.5s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 83.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 18793 SdHoareTripleChecker+Valid, 78.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18793 mSDsluCounter, 7469 SdHoareTripleChecker+Invalid, 68.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1248 mSDsCounter, 11675 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38375 IncrementalHoareTripleChecker+Invalid, 50052 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11675 mSolverCounterUnsat, 6221 mSDtfsCounter, 38375 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6388 GetRequests, 6297 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31234occurred in iteration=15, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 82084 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 38.6s InterpolantComputationTime, 11651 NumberOfCodeBlocks, 11651 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 13557 ConstructedInterpolants, 282 QuantifiedInterpolants, 91320 SizeOfPredicates, 12 NumberOfNonLiveVariables, 4523 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 33 InterpolantComputations, 18 PerfectInterpolantSequences, 5674/8586 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-11-24 01:49:57,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a5baa33-b04e-4201-abcf-fb359b361cb2/bin/uautomizer-verify-LYvppIcaGC/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