./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:54:17,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:54:17,653 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:54:17,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:54:17,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:54:17,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:54:17,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:54:17,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:54:17,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:54:17,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:54:17,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:54:17,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:54:17,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:54:17,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:54:17,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:54:17,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:54:17,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:54:17,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:54:17,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:54:17,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:54:17,716 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:54:17,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:54:17,716 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:54:17,717 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:54:17,717 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:54:17,717 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:54:17,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:54:17,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:54:17,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:54:17,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:54:17,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:54:17,720 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:54:17,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:54:17,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk 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 -> Kojak 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 -> 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 [2024-11-09 00:54:17,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:54:18,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:54:18,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:54:18,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:54:18,011 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:54:18,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c Unable to find full path for "g++" [2024-11-09 00:54:20,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:54:20,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:54:20,281 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2024-11-09 00:54:20,299 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/data/9959fde23/c573f128201b4ead9df81e0f7e572101/FLAGb1dc17f0e [2024-11-09 00:54:20,572 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/data/9959fde23/c573f128201b4ead9df81e0f7e572101 [2024-11-09 00:54:20,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:54:20,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:54:20,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:20,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:54:20,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:54:20,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:20" (1/1) ... [2024-11-09 00:54:20,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9e43ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:20, skipping insertion in model container [2024-11-09 00:54:20,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:20" (1/1) ... [2024-11-09 00:54:20,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:54:20,986 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_628983c4-8d5d-44fc-9a74-564c8597950a/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2024-11-09 00:54:21,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:21,068 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:54:21,223 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_628983c4-8d5d-44fc-9a74-564c8597950a/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2024-11-09 00:54:21,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:21,287 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:54:21,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21 WrapperNode [2024-11-09 00:54:21,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:21,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:21,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:54:21,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:54:21,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,378 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-09 00:54:21,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:21,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:54:21,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:54:21,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:54:21,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:54:21,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:54:21,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:54:21,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:54:21,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:21" (1/1) ... [2024-11-09 00:54:21,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:54:21,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:54:21,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:54:21,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:54:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:54:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:54:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:54:21,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:54:21,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:54:21,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:54:22,807 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 00:54:22,809 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:54:23,074 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:54:23,075 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:54:23,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:23 BoogieIcfgContainer [2024-11-09 00:54:23,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:54:23,076 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:54:23,076 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:54:23,086 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:54:23,086 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:23" (1/1) ... [2024-11-09 00:54:23,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-09 00:54:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-09 00:54:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:54:23,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:23,716 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-09 00:54:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2024-11-09 00:54:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2024-11-09 00:54:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:54:24,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:24,662 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-09 00:54:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2024-11-09 00:54:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2024-11-09 00:54:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 00:54:25,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:25,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:54:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2024-11-09 00:54:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2024-11-09 00:54:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 00:54:25,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:25,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 236 states and 328 transitions. [2024-11-09 00:54:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2024-11-09 00:54:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:54:26,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:54:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 237 states and 330 transitions. [2024-11-09 00:54:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2024-11-09 00:54:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 00:54:26,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:26,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:54:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 262 states and 361 transitions. [2024-11-09 00:54:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 361 transitions. [2024-11-09 00:54:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 00:54:27,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 288 states and 392 transitions. [2024-11-09 00:54:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 392 transitions. [2024-11-09 00:54:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:54:28,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:54:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 309 states and 416 transitions. [2024-11-09 00:54:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 416 transitions. [2024-11-09 00:54:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 00:54:28,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 334 states and 443 transitions. [2024-11-09 00:54:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 443 transitions. [2024-11-09 00:54:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:54:29,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:54:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 335 states and 445 transitions. [2024-11-09 00:54:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 445 transitions. [2024-11-09 00:54:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:54:29,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:54:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 338 states and 449 transitions. [2024-11-09 00:54:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2024-11-09 00:54:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 00:54:29,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:29,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:54:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 347 states and 463 transitions. [2024-11-09 00:54:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 463 transitions. [2024-11-09 00:54:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 00:54:30,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 353 states and 469 transitions. [2024-11-09 00:54:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2024-11-09 00:54:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 00:54:30,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:54:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 374 states and 492 transitions. [2024-11-09 00:54:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 492 transitions. [2024-11-09 00:54:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 00:54:31,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 392 states and 512 transitions. [2024-11-09 00:54:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 512 transitions. [2024-11-09 00:54:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 00:54:31,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 406 states and 528 transitions. [2024-11-09 00:54:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 528 transitions. [2024-11-09 00:54:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 00:54:31,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 412 states and 535 transitions. [2024-11-09 00:54:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 535 transitions. [2024-11-09 00:54:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 00:54:32,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 450 states and 577 transitions. [2024-11-09 00:54:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 577 transitions. [2024-11-09 00:54:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:54:32,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:32,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:54:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 462 states and 589 transitions. [2024-11-09 00:54:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 589 transitions. [2024-11-09 00:54:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:54:33,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 475 states and 604 transitions. [2024-11-09 00:54:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 604 transitions. [2024-11-09 00:54:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 00:54:33,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:33,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 481 states and 612 transitions. [2024-11-09 00:54:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 612 transitions. [2024-11-09 00:54:34,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 00:54:34,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:34,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 00:54:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 510 states and 644 transitions. [2024-11-09 00:54:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 644 transitions. [2024-11-09 00:54:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 00:54:34,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:34,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:54:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 520 states and 654 transitions. [2024-11-09 00:54:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 654 transitions. [2024-11-09 00:54:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 00:54:35,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:54:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 544 states and 679 transitions. [2024-11-09 00:54:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 679 transitions. [2024-11-09 00:54:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:54:35,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 566 states and 706 transitions. [2024-11-09 00:54:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 706 transitions. [2024-11-09 00:54:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:54:36,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 00:54:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 567 states and 708 transitions. [2024-11-09 00:54:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 708 transitions. [2024-11-09 00:54:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 00:54:36,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:54:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 666 states and 816 transitions. [2024-11-09 00:54:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 816 transitions. [2024-11-09 00:54:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 00:54:38,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:38,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 78 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:54:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 703 states and 861 transitions. [2024-11-09 00:54:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 861 transitions. [2024-11-09 00:54:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 00:54:39,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:39,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:54:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 704 states and 868 transitions. [2024-11-09 00:54:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 868 transitions. [2024-11-09 00:54:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 00:54:39,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:39,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:54:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 705 states and 868 transitions. [2024-11-09 00:54:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 868 transitions. [2024-11-09 00:54:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:54:40,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:40,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 00:54:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 722 states and 887 transitions. [2024-11-09 00:54:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 887 transitions. [2024-11-09 00:54:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:54:40,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:40,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 00:54:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 734 states and 900 transitions. [2024-11-09 00:54:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 900 transitions. [2024-11-09 00:54:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:54:41,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 00:54:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 748 states and 914 transitions. [2024-11-09 00:54:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 914 transitions. [2024-11-09 00:54:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 00:54:41,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 832 states and 1016 transitions. [2024-11-09 00:54:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1016 transitions. [2024-11-09 00:54:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 00:54:44,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:54:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 853 states and 1039 transitions. [2024-11-09 00:54:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1039 transitions. [2024-11-09 00:54:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:54:44,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:44,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 00:54:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 854 states and 1039 transitions. [2024-11-09 00:54:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1039 transitions. [2024-11-09 00:54:45,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:54:45,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:54:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 885 states and 1080 transitions. [2024-11-09 00:54:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1080 transitions. [2024-11-09 00:54:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 00:54:46,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:54:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 913 states and 1112 transitions. [2024-11-09 00:54:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1112 transitions. [2024-11-09 00:54:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:54:47,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-09 00:54:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 915 states and 1113 transitions. [2024-11-09 00:54:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1113 transitions. [2024-11-09 00:54:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 00:54:47,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:47,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 00:54:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 916 states and 1115 transitions. [2024-11-09 00:54:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1115 transitions. [2024-11-09 00:54:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 00:54:48,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1000 states and 1208 transitions. [2024-11-09 00:54:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1208 transitions. [2024-11-09 00:54:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:54:52,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:52,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 96 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:54:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1069 states and 1290 transitions. [2024-11-09 00:54:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1290 transitions. [2024-11-09 00:54:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:54:54,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:54:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1090 states and 1317 transitions. [2024-11-09 00:54:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1317 transitions. [2024-11-09 00:54:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 00:54:54,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:54,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 00:54:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1127 states and 1354 transitions. [2024-11-09 00:54:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1354 transitions. [2024-11-09 00:54:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 00:54:55,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:54:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1202 states and 1447 transitions. [2024-11-09 00:54:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1447 transitions. [2024-11-09 00:54:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 00:54:58,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:58,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:54:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:54:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1204 states and 1451 transitions. [2024-11-09 00:54:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1451 transitions. [2024-11-09 00:54:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 00:54:59,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:54:59,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 143 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1205 states and 1451 transitions. [2024-11-09 00:55:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1451 transitions. [2024-11-09 00:55:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-09 00:55:00,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:55:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1273 states and 1520 transitions. [2024-11-09 00:55:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1520 transitions. [2024-11-09 00:55:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-09 00:55:02,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:02,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:55:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1276 states and 1522 transitions. [2024-11-09 00:55:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1522 transitions. [2024-11-09 00:55:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 00:55:03,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 99 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:55:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1291 states and 1541 transitions. [2024-11-09 00:55:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1541 transitions. [2024-11-09 00:55:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-09 00:55:04,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:04,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 00:55:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1292 states and 1546 transitions. [2024-11-09 00:55:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1546 transitions. [2024-11-09 00:55:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 00:55:04,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 00:55:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1293 states and 1547 transitions. [2024-11-09 00:55:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1547 transitions. [2024-11-09 00:55:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 00:55:05,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 119 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 00:55:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1294 states and 1548 transitions. [2024-11-09 00:55:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1548 transitions. [2024-11-09 00:55:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 00:55:06,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-09 00:55:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1301 states and 1559 transitions. [2024-11-09 00:55:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1559 transitions. [2024-11-09 00:55:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 00:55:07,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 00:55:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1312 states and 1571 transitions. [2024-11-09 00:55:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1571 transitions. [2024-11-09 00:55:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-09 00:55:08,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:08,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 00:55:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1313 states and 1572 transitions. [2024-11-09 00:55:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1572 transitions. [2024-11-09 00:55:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-09 00:55:08,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:08,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 00:55:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1358 states and 1631 transitions. [2024-11-09 00:55:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1631 transitions. [2024-11-09 00:55:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-09 00:55:10,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 00:55:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1366 states and 1638 transitions. [2024-11-09 00:55:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1638 transitions. [2024-11-09 00:55:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-09 00:55:11,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:55:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1381 states and 1658 transitions. [2024-11-09 00:55:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1658 transitions. [2024-11-09 00:55:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-09 00:55:12,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:55:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1417 states and 1708 transitions. [2024-11-09 00:55:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1708 transitions. [2024-11-09 00:55:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-09 00:55:15,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:55:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1435 states and 1728 transitions. [2024-11-09 00:55:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1728 transitions. [2024-11-09 00:55:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:55:15,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 00:55:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1443 states and 1736 transitions. [2024-11-09 00:55:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1736 transitions. [2024-11-09 00:55:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-09 00:55:16,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:16,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1479 states and 1783 transitions. [2024-11-09 00:55:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1783 transitions. [2024-11-09 00:55:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-09 00:55:20,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1500 states and 1808 transitions. [2024-11-09 00:55:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1808 transitions. [2024-11-09 00:55:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-09 00:55:22,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1518 states and 1827 transitions. [2024-11-09 00:55:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1827 transitions. [2024-11-09 00:55:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-09 00:55:23,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1520 states and 1828 transitions. [2024-11-09 00:55:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1828 transitions. [2024-11-09 00:55:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-09 00:55:24,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:24,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-09 00:55:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1521 states and 1828 transitions. [2024-11-09 00:55:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1828 transitions. [2024-11-09 00:55:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-09 00:55:24,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:24,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 143 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1638 states and 1972 transitions. [2024-11-09 00:55:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 1972 transitions. [2024-11-09 00:55:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-09 00:55:28,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 143 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1653 states and 1986 transitions. [2024-11-09 00:55:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1986 transitions. [2024-11-09 00:55:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-09 00:55:29,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:29,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-09 00:55:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 1674 states and 2012 transitions. [2024-11-09 00:55:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2012 transitions. [2024-11-09 00:55:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-09 00:55:31,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:31,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:55:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1694 states and 2036 transitions. [2024-11-09 00:55:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2036 transitions. [2024-11-09 00:55:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-09 00:55:32,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:32,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:55:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 1709 states and 2054 transitions. [2024-11-09 00:55:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2054 transitions. [2024-11-09 00:55:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 00:55:34,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 1765 states and 2122 transitions. [2024-11-09 00:55:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2122 transitions. [2024-11-09 00:55:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 00:55:40,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1781 states and 2140 transitions. [2024-11-09 00:55:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2140 transitions. [2024-11-09 00:55:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 00:55:41,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 1814 states and 2176 transitions. [2024-11-09 00:55:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2176 transitions. [2024-11-09 00:55:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 00:55:44,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:44,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 1834 states and 2197 transitions. [2024-11-09 00:55:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2197 transitions. [2024-11-09 00:55:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 00:55:46,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:46,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 151 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1878 states and 2256 transitions. [2024-11-09 00:55:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2256 transitions. [2024-11-09 00:55:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 00:55:48,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 151 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 1886 states and 2263 transitions. [2024-11-09 00:55:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2263 transitions. [2024-11-09 00:55:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 00:55:49,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:49,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-09 00:55:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 1907 states and 2288 transitions. [2024-11-09 00:55:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2288 transitions. [2024-11-09 00:55:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 00:55:51,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:51,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 154 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 1959 states and 2346 transitions. [2024-11-09 00:55:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2346 transitions. [2024-11-09 00:55:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 00:55:56,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 154 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:55:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:55:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 1989 states and 2378 transitions. [2024-11-09 00:55:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2378 transitions. [2024-11-09 00:55:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-09 00:55:59,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:55:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-09 00:56:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 1990 states and 2379 transitions. [2024-11-09 00:56:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2379 transitions. [2024-11-09 00:56:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-09 00:56:00,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:00,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 178 proven. 67 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:56:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2038 states and 2431 transitions. [2024-11-09 00:56:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2431 transitions. [2024-11-09 00:56:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:56:02,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 130 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:56:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2105 states and 2517 transitions. [2024-11-09 00:56:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2517 transitions. [2024-11-09 00:56:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:56:09,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:09,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 130 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:56:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2121 states and 2538 transitions. [2024-11-09 00:56:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2538 transitions. [2024-11-09 00:56:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:56:11,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 130 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:56:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2142 states and 2561 transitions. [2024-11-09 00:56:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2561 transitions. [2024-11-09 00:56:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:56:13,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:13,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 130 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:56:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2160 states and 2580 transitions. [2024-11-09 00:56:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 2580 transitions. [2024-11-09 00:56:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:56:15,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 130 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:56:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2180 states and 2601 transitions. [2024-11-09 00:56:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2601 transitions. [2024-11-09 00:56:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 00:56:17,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 160 proven. 104 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 00:56:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2215 states and 2638 transitions. [2024-11-09 00:56:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2638 transitions. [2024-11-09 00:56:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 00:56:22,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 160 proven. 104 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 00:56:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2282 states and 2706 transitions. [2024-11-09 00:56:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 2706 transitions. [2024-11-09 00:56:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:56:26,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 164 proven. 101 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:56:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2352 states and 2782 transitions. [2024-11-09 00:56:30,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 2782 transitions. [2024-11-09 00:56:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:56:30,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:30,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 164 proven. 101 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:56:32,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2404 states and 2836 transitions. [2024-11-09 00:56:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 2836 transitions. [2024-11-09 00:56:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:56:32,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-09 00:56:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2410 states and 2848 transitions. [2024-11-09 00:56:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2848 transitions. [2024-11-09 00:56:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:56:33,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:33,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-09 00:56:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2414 states and 2851 transitions. [2024-11-09 00:56:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2851 transitions. [2024-11-09 00:56:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:56:34,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:34,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-09 00:56:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2418 states and 2854 transitions. [2024-11-09 00:56:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2854 transitions. [2024-11-09 00:56:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-09 00:56:34,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 259 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 00:56:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2419 states and 2854 transitions. [2024-11-09 00:56:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2854 transitions. [2024-11-09 00:56:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:56:35,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 132 proven. 166 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-09 00:56:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2502 states and 2942 transitions. [2024-11-09 00:56:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2942 transitions. [2024-11-09 00:56:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 00:56:37,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:37,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:56:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:37,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:56:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:37,671 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 98 iterations. [2024-11-09 00:56:37,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:56:37 ImpRootNode [2024-11-09 00:56:37,864 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:56:37,864 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:56:37,865 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:56:37,865 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:56:37,865 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:23" (3/4) ... [2024-11-09 00:56:37,866 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 00:56:38,074 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:56:38,074 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:56:38,075 INFO L158 Benchmark]: Toolchain (without parser) took 137498.86ms. Allocated memory was 144.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 104.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 846.7MB. Max. memory is 16.1GB. [2024-11-09 00:56:38,075 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 144.7MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:56:38,075 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.63ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 74.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 00:56:38,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.79ms. Allocated memory is still 144.7MB. Free memory was 74.4MB in the beginning and 68.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:56:38,076 INFO L158 Benchmark]: Boogie Preprocessor took 61.77ms. Allocated memory is still 144.7MB. Free memory was 68.7MB in the beginning and 63.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:56:38,076 INFO L158 Benchmark]: RCFGBuilder took 1634.00ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 63.9MB in the beginning and 92.6MB in the end (delta: -28.6MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-11-09 00:56:38,077 INFO L158 Benchmark]: CodeCheck took 134787.94ms. Allocated memory was 184.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 92.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 763.6MB. Max. memory is 16.1GB. [2024-11-09 00:56:38,077 INFO L158 Benchmark]: Witness Printer took 209.62ms. Allocated memory is still 2.0GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 00:56:38,079 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 134.6s, OverallIterations: 98, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235739 SdHoareTripleChecker+Valid, 684.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234970 mSDsluCounter, 36741 SdHoareTripleChecker+Invalid, 583.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32246 mSDsCounter, 61172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 516086 IncrementalHoareTripleChecker+Invalid, 577258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61172 mSolverCounterUnsat, 4495 mSDtfsCounter, 516086 mSolverCounterSat, 6.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113315 GetRequests, 108388 SyntacticMatches, 4081 SemanticMatches, 846 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475922 ImplicationChecksByTransitivity, 89.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 16964 NumberOfCodeBlocks, 16964 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 16624 ConstructedInterpolants, 0 QuantifiedInterpolants, 93522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 60 PerfectInterpolantSequences, 13255/16100 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 408]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L159] a16 = 4 [L160] a17 = 0 [L161] return 25; VAL [\result=25, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L140] a8 = 15 [L141] a17 = 0 [L142] a21 = 1 [L143] a20 = 0 [L144] a16 = 4 [L145] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] reach_error() VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 144.7MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.63ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 74.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.79ms. Allocated memory is still 144.7MB. Free memory was 74.4MB in the beginning and 68.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.77ms. Allocated memory is still 144.7MB. Free memory was 68.7MB in the beginning and 63.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1634.00ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 63.9MB in the beginning and 92.6MB in the end (delta: -28.6MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * CodeCheck took 134787.94ms. Allocated memory was 184.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 92.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 763.6MB. Max. memory is 16.1GB. * Witness Printer took 209.62ms. Allocated memory is still 2.0GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 00:56:38,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628983c4-8d5d-44fc-9a74-564c8597950a/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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