./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b --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 7c8c0e9a48a9f16e1776fdefc0f855c8a0d9d5ce1c74cc0228b67d8d420034c4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:20:29,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:20:29,475 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 04:20:29,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:20:29,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:20:29,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:20:29,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 04:20:29,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 04:20:29,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:20:29,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:20:29,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:20:29,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 04:20:29,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 04:20:29,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:20:29,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 04:20:29,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:20:29,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 04:20:29,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:20:29,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 04:20:29,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 04:20:29,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 04:20:29,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:20:29,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:20:29,501 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:20:29,501 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:20:29,501 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:20:29,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:20:29,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:20:29,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:20:29,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:20:29,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 04:20:29,502 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:20:29,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:20:29,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b 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 -> 7c8c0e9a48a9f16e1776fdefc0f855c8a0d9d5ce1c74cc0228b67d8d420034c4 [2024-12-06 04:20:29,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:20:29,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:20:29,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:20:29,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:20:29,751 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:20:29,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c [2024-12-06 04:20:32,412 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/data/019ec328a/c65d7e2cbb9e451db93eff101b16bbd0/FLAG95d4e85bb [2024-12-06 04:20:32,687 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:20:32,688 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/sv-benchmarks/c/eca-rers2012/Problem01_label50.c [2024-12-06 04:20:32,699 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/data/019ec328a/c65d7e2cbb9e451db93eff101b16bbd0/FLAG95d4e85bb [2024-12-06 04:20:32,996 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/data/019ec328a/c65d7e2cbb9e451db93eff101b16bbd0 [2024-12-06 04:20:32,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:20:32,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:20:32,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:20:32,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:20:33,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:20:33,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:20:32" (1/1) ... [2024-12-06 04:20:33,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c96e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33, skipping insertion in model container [2024-12-06 04:20:33,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:20:32" (1/1) ... [2024-12-06 04:20:33,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:20:33,249 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_4a1dd6f3-39cc-42cb-b649-9c3614191f37/sv-benchmarks/c/eca-rers2012/Problem01_label50.c[15378,15391] [2024-12-06 04:20:33,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:20:33,288 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:20:33,351 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_4a1dd6f3-39cc-42cb-b649-9c3614191f37/sv-benchmarks/c/eca-rers2012/Problem01_label50.c[15378,15391] [2024-12-06 04:20:33,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:20:33,382 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:20:33,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33 WrapperNode [2024-12-06 04:20:33,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:20:33,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:20:33,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:20:33,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:20:33,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,439 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 04:20:33,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:20:33,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:20:33,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:20:33,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:20:33,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:20:33,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:20:33,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:20:33,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:20:33,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:33" (1/1) ... [2024-12-06 04:20:33,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:20:33,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:20:33,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:20:33,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:20:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 04:20:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 04:20:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:20:33,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:20:33,601 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:20:33,602 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:20:34,424 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 04:20:34,424 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:20:34,657 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:20:34,657 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 04:20:34,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:20:34 BoogieIcfgContainer [2024-12-06 04:20:34,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:20:34,658 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:20:34,658 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:20:34,667 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:20:34,667 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:20:34" (1/1) ... [2024-12-06 04:20:34,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:20:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 04:20:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 04:20:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 04:20:34,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-12-06 04:20:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-12-06 04:20:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 04:20:35,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-12-06 04:20:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-12-06 04:20:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 04:20:36,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-12-06 04:20:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-12-06 04:20:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 04:20:36,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 221 states and 317 transitions. [2024-12-06 04:20:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 317 transitions. [2024-12-06 04:20:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 04:20:37,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 233 states and 332 transitions. [2024-12-06 04:20:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 332 transitions. [2024-12-06 04:20:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-06 04:20:37,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 249 states and 353 transitions. [2024-12-06 04:20:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2024-12-06 04:20:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-06 04:20:38,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:38,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:20:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 262 states and 368 transitions. [2024-12-06 04:20:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 368 transitions. [2024-12-06 04:20:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-06 04:20:38,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:38,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 282 states and 394 transitions. [2024-12-06 04:20:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 394 transitions. [2024-12-06 04:20:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 04:20:39,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 290 states and 408 transitions. [2024-12-06 04:20:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 408 transitions. [2024-12-06 04:20:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 04:20:39,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:39,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 306 states and 427 transitions. [2024-12-06 04:20:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 427 transitions. [2024-12-06 04:20:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-06 04:20:39,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:20:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 312 states and 435 transitions. [2024-12-06 04:20:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 435 transitions. [2024-12-06 04:20:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-06 04:20:40,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:20:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 319 states and 441 transitions. [2024-12-06 04:20:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 441 transitions. [2024-12-06 04:20:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 04:20:40,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:20:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 328 states and 451 transitions. [2024-12-06 04:20:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 451 transitions. [2024-12-06 04:20:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 04:20:40,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 334 states and 459 transitions. [2024-12-06 04:20:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 459 transitions. [2024-12-06 04:20:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 04:20:40,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:40,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:20:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 342 states and 468 transitions. [2024-12-06 04:20:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 468 transitions. [2024-12-06 04:20:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 04:20:41,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 344 states and 471 transitions. [2024-12-06 04:20:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 471 transitions. [2024-12-06 04:20:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-06 04:20:41,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:41,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 358 states and 487 transitions. [2024-12-06 04:20:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 487 transitions. [2024-12-06 04:20:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 04:20:41,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 365 states and 494 transitions. [2024-12-06 04:20:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 494 transitions. [2024-12-06 04:20:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-06 04:20:42,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:42,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 371 states and 500 transitions. [2024-12-06 04:20:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 500 transitions. [2024-12-06 04:20:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 04:20:42,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 375 states and 504 transitions. [2024-12-06 04:20:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 504 transitions. [2024-12-06 04:20:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 04:20:42,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 381 states and 511 transitions. [2024-12-06 04:20:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 511 transitions. [2024-12-06 04:20:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 04:20:42,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 395 states and 527 transitions. [2024-12-06 04:20:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 527 transitions. [2024-12-06 04:20:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 04:20:43,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 431 states and 571 transitions. [2024-12-06 04:20:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 571 transitions. [2024-12-06 04:20:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 04:20:43,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:43,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 459 states and 603 transitions. [2024-12-06 04:20:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 603 transitions. [2024-12-06 04:20:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 04:20:44,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 463 states and 609 transitions. [2024-12-06 04:20:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 609 transitions. [2024-12-06 04:20:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 04:20:44,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:44,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 503 states and 662 transitions. [2024-12-06 04:20:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 662 transitions. [2024-12-06 04:20:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 04:20:45,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:45,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 514 states and 672 transitions. [2024-12-06 04:20:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 672 transitions. [2024-12-06 04:20:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 04:20:46,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:46,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:20:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 547 states and 712 transitions. [2024-12-06 04:20:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 712 transitions. [2024-12-06 04:20:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 04:20:46,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:20:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 551 states and 715 transitions. [2024-12-06 04:20:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 715 transitions. [2024-12-06 04:20:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 04:20:47,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:47,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 04:20:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 552 states and 716 transitions. [2024-12-06 04:20:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 716 transitions. [2024-12-06 04:20:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 04:20:47,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 04:20:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 558 states and 722 transitions. [2024-12-06 04:20:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 722 transitions. [2024-12-06 04:20:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 04:20:47,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:47,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:20:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 571 states and 735 transitions. [2024-12-06 04:20:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 735 transitions. [2024-12-06 04:20:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 04:20:47,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:20:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 572 states and 736 transitions. [2024-12-06 04:20:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 736 transitions. [2024-12-06 04:20:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 04:20:47,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:47,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 582 states and 748 transitions. [2024-12-06 04:20:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2024-12-06 04:20:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 04:20:48,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:48,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 587 states and 754 transitions. [2024-12-06 04:20:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 754 transitions. [2024-12-06 04:20:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-12-06 04:20:48,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 04:20:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 592 states and 761 transitions. [2024-12-06 04:20:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 761 transitions. [2024-12-06 04:20:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 04:20:49,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 04:20:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 605 states and 776 transitions. [2024-12-06 04:20:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2024-12-06 04:20:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 04:20:49,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 611 states and 785 transitions. [2024-12-06 04:20:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 785 transitions. [2024-12-06 04:20:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 04:20:49,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 620 states and 798 transitions. [2024-12-06 04:20:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 798 transitions. [2024-12-06 04:20:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 04:20:49,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-12-06 04:20:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 704 states and 885 transitions. [2024-12-06 04:20:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 885 transitions. [2024-12-06 04:20:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 04:20:50,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 04:20:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 719 states and 899 transitions. [2024-12-06 04:20:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 899 transitions. [2024-12-06 04:20:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 04:20:50,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:50,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 733 states and 916 transitions. [2024-12-06 04:20:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 916 transitions. [2024-12-06 04:20:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 04:20:51,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:51,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 783 states and 977 transitions. [2024-12-06 04:20:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 977 transitions. [2024-12-06 04:20:53,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 04:20:53,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 828 states and 1038 transitions. [2024-12-06 04:20:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1038 transitions. [2024-12-06 04:20:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 04:20:54,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 839 states and 1050 transitions. [2024-12-06 04:20:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1050 transitions. [2024-12-06 04:20:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 04:20:55,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:55,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:20:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 847 states and 1059 transitions. [2024-12-06 04:20:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1059 transitions. [2024-12-06 04:20:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-06 04:20:55,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 04:20:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 895 states and 1110 transitions. [2024-12-06 04:20:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1110 transitions. [2024-12-06 04:20:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 04:20:56,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:56,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 04:20:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 903 states and 1119 transitions. [2024-12-06 04:20:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1119 transitions. [2024-12-06 04:20:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 04:20:56,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 04:20:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 908 states and 1125 transitions. [2024-12-06 04:20:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1125 transitions. [2024-12-06 04:20:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 04:20:56,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1045 states and 1270 transitions. [2024-12-06 04:20:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1270 transitions. [2024-12-06 04:20:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 04:20:59,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 04:20:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1046 states and 1270 transitions. [2024-12-06 04:20:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1270 transitions. [2024-12-06 04:20:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 04:20:59,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 75 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:20:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1050 states and 1278 transitions. [2024-12-06 04:20:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1278 transitions. [2024-12-06 04:20:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 04:20:59,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 04:20:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:20:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1064 states and 1297 transitions. [2024-12-06 04:20:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1297 transitions. [2024-12-06 04:20:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 04:20:59,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:20:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:20:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:20:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 04:21:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1086 states and 1321 transitions. [2024-12-06 04:21:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1321 transitions. [2024-12-06 04:21:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 04:21:00,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:21:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1115 states and 1355 transitions. [2024-12-06 04:21:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1355 transitions. [2024-12-06 04:21:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 04:21:01,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:21:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1121 states and 1361 transitions. [2024-12-06 04:21:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1361 transitions. [2024-12-06 04:21:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 04:21:01,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:21:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1125 states and 1364 transitions. [2024-12-06 04:21:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1364 transitions. [2024-12-06 04:21:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 04:21:01,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1132 states and 1372 transitions. [2024-12-06 04:21:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1372 transitions. [2024-12-06 04:21:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 04:21:02,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:21:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1203 states and 1443 transitions. [2024-12-06 04:21:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1443 transitions. [2024-12-06 04:21:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 04:21:03,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 04:21:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1211 states and 1451 transitions. [2024-12-06 04:21:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1451 transitions. [2024-12-06 04:21:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 04:21:03,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:03,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 04:21:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1215 states and 1454 transitions. [2024-12-06 04:21:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1454 transitions. [2024-12-06 04:21:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 04:21:04,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:21:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1228 states and 1471 transitions. [2024-12-06 04:21:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1471 transitions. [2024-12-06 04:21:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-06 04:21:05,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 04:21:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1247 states and 1497 transitions. [2024-12-06 04:21:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1497 transitions. [2024-12-06 04:21:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-06 04:21:06,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 04:21:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1260 states and 1511 transitions. [2024-12-06 04:21:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1511 transitions. [2024-12-06 04:21:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-06 04:21:06,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1277 states and 1528 transitions. [2024-12-06 04:21:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1528 transitions. [2024-12-06 04:21:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-06 04:21:07,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 04:21:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1286 states and 1538 transitions. [2024-12-06 04:21:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1538 transitions. [2024-12-06 04:21:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-06 04:21:07,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:07,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 04:21:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1295 states and 1548 transitions. [2024-12-06 04:21:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1548 transitions. [2024-12-06 04:21:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-12-06 04:21:08,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 04:21:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1296 states and 1552 transitions. [2024-12-06 04:21:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1552 transitions. [2024-12-06 04:21:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-12-06 04:21:08,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:08,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 04:21:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1299 states and 1558 transitions. [2024-12-06 04:21:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1558 transitions. [2024-12-06 04:21:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 04:21:08,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 118 proven. 29 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 04:21:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1306 states and 1564 transitions. [2024-12-06 04:21:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1564 transitions. [2024-12-06 04:21:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-06 04:21:09,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:09,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-06 04:21:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1320 states and 1577 transitions. [2024-12-06 04:21:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1577 transitions. [2024-12-06 04:21:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-12-06 04:21:09,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:09,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 04:21:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1345 states and 1604 transitions. [2024-12-06 04:21:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1604 transitions. [2024-12-06 04:21:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-06 04:21:10,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:10,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 109 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1391 states and 1674 transitions. [2024-12-06 04:21:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1674 transitions. [2024-12-06 04:21:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-06 04:21:12,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 109 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1397 states and 1685 transitions. [2024-12-06 04:21:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1685 transitions. [2024-12-06 04:21:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-06 04:21:13,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 04:21:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1398 states and 1686 transitions. [2024-12-06 04:21:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1686 transitions. [2024-12-06 04:21:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 04:21:13,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-06 04:21:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1406 states and 1694 transitions. [2024-12-06 04:21:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1694 transitions. [2024-12-06 04:21:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 04:21:14,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1417 states and 1711 transitions. [2024-12-06 04:21:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1711 transitions. [2024-12-06 04:21:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 04:21:15,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:15,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 04:21:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1445 states and 1742 transitions. [2024-12-06 04:21:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1742 transitions. [2024-12-06 04:21:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-06 04:21:16,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-06 04:21:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1453 states and 1749 transitions. [2024-12-06 04:21:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1749 transitions. [2024-12-06 04:21:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 04:21:16,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-12-06 04:21:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1462 states and 1757 transitions. [2024-12-06 04:21:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1757 transitions. [2024-12-06 04:21:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 04:21:16,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:16,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 122 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-06 04:21:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1474 states and 1772 transitions. [2024-12-06 04:21:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1772 transitions. [2024-12-06 04:21:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-06 04:21:17,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-06 04:21:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1478 states and 1777 transitions. [2024-12-06 04:21:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1777 transitions. [2024-12-06 04:21:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-06 04:21:18,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 172 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1496 states and 1804 transitions. [2024-12-06 04:21:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1804 transitions. [2024-12-06 04:21:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-06 04:21:20,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:20,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 172 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1512 states and 1827 transitions. [2024-12-06 04:21:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1827 transitions. [2024-12-06 04:21:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-06 04:21:22,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:22,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 172 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1517 states and 1831 transitions. [2024-12-06 04:21:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1831 transitions. [2024-12-06 04:21:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-06 04:21:23,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 122 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1546 states and 1870 transitions. [2024-12-06 04:21:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1870 transitions. [2024-12-06 04:21:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-06 04:21:25,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 122 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1560 states and 1887 transitions. [2024-12-06 04:21:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1887 transitions. [2024-12-06 04:21:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-06 04:21:26,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:21:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1591 states and 1918 transitions. [2024-12-06 04:21:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1918 transitions. [2024-12-06 04:21:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 04:21:27,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 1681 states and 2050 transitions. [2024-12-06 04:21:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2050 transitions. [2024-12-06 04:21:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 04:21:33,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:33,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 1692 states and 2066 transitions. [2024-12-06 04:21:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2066 transitions. [2024-12-06 04:21:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 04:21:35,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 04:21:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 1723 states and 2102 transitions. [2024-12-06 04:21:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2102 transitions. [2024-12-06 04:21:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 04:21:36,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:36,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 04:21:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 1745 states and 2123 transitions. [2024-12-06 04:21:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2123 transitions. [2024-12-06 04:21:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 04:21:36,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 127 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 1795 states and 2197 transitions. [2024-12-06 04:21:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2197 transitions. [2024-12-06 04:21:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 04:21:40,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:40,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 137 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 04:21:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 1810 states and 2216 transitions. [2024-12-06 04:21:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2216 transitions. [2024-12-06 04:21:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 04:21:41,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:41,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 04:21:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 1825 states and 2232 transitions. [2024-12-06 04:21:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2232 transitions. [2024-12-06 04:21:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 04:21:42,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:42,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 04:21:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 1827 states and 2234 transitions. [2024-12-06 04:21:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2234 transitions. [2024-12-06 04:21:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 04:21:42,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 04:21:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 1834 states and 2240 transitions. [2024-12-06 04:21:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2240 transitions. [2024-12-06 04:21:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 04:21:43,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:43,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 04:21:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1850 states and 2258 transitions. [2024-12-06 04:21:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2258 transitions. [2024-12-06 04:21:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 04:21:44,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:44,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-12-06 04:21:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1861 states and 2270 transitions. [2024-12-06 04:21:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2270 transitions. [2024-12-06 04:21:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 04:21:45,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:45,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:21:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 1904 states and 2326 transitions. [2024-12-06 04:21:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2326 transitions. [2024-12-06 04:21:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 04:21:50,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:50,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:21:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 1918 states and 2341 transitions. [2024-12-06 04:21:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2341 transitions. [2024-12-06 04:21:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-12-06 04:21:51,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:51,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 142 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 1925 states and 2357 transitions. [2024-12-06 04:21:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2357 transitions. [2024-12-06 04:21:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-12-06 04:21:53,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 142 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 1941 states and 2379 transitions. [2024-12-06 04:21:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2379 transitions. [2024-12-06 04:21:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-12-06 04:21:54,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 142 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 1949 states and 2395 transitions. [2024-12-06 04:21:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2395 transitions. [2024-12-06 04:21:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-12-06 04:21:56,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:56,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:21:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 142 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:21:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:21:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 1955 states and 2408 transitions. [2024-12-06 04:21:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2408 transitions. [2024-12-06 04:21:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 04:21:58,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:21:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:21:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:21:58,716 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:21:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:21:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:21:58,883 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:21:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:21:58,978 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 106 iterations. [2024-12-06 04:21:59,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:21:59 ImpRootNode [2024-12-06 04:21:59,069 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:21:59,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:21:59,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:21:59,069 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:21:59,070 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:20:34" (3/4) ... [2024-12-06 04:21:59,070 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 04:21:59,167 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 205. [2024-12-06 04:21:59,262 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:21:59,262 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:21:59,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:21:59,263 INFO L158 Benchmark]: Toolchain (without parser) took 86264.77ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 91.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 332.9MB. Max. memory is 16.1GB. [2024-12-06 04:21:59,263 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:21:59,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.40ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 64.1MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 04:21:59,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.25ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:21:59,264 INFO L158 Benchmark]: Boogie Preprocessor took 50.58ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 54.4MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:21:59,264 INFO L158 Benchmark]: RCFGBuilder took 1165.96ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 54.4MB in the beginning and 179.4MB in the end (delta: -125.0MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-12-06 04:21:59,264 INFO L158 Benchmark]: CodeCheck took 84410.61ms. Allocated memory was 226.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 179.4MB in the beginning and 1.2GB in the end (delta: -976.8MB). Peak memory consumption was 280.1MB. Max. memory is 16.1GB. [2024-12-06 04:21:59,265 INFO L158 Benchmark]: Witness Printer took 193.05ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-06 04:21:59,267 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: 84.3s, OverallIterations: 106, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 214282 SdHoareTripleChecker+Valid, 472.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210951 mSDsluCounter, 33617 SdHoareTripleChecker+Invalid, 399.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28406 mSDsCounter, 61389 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 471098 IncrementalHoareTripleChecker+Invalid, 532487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61389 mSolverCounterUnsat, 5211 mSDtfsCounter, 471098 mSolverCounterSat, 4.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101156 GetRequests, 96785 SyntacticMatches, 3477 SemanticMatches, 894 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522236 ImplicationChecksByTransitivity, 59.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 15231 NumberOfCodeBlocks, 15231 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 14927 ConstructedInterpolants, 0 QuantifiedInterpolants, 60937 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 105 InterpolantComputations, 70 PerfectInterpolantSequences, 10028/10960 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, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 423]: 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] [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) [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) [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) [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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND TRUE ((((((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)) [L95] a7 = 0 [L96] a20 = 1 [L97] a8 = 14 [L98] a16 = 4 [L99] a21 = 1 [L100] a17 = 0 [L101] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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) [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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L423] reach_error() VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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.26ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.40ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 64.1MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.25ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.58ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 54.4MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1165.96ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 54.4MB in the beginning and 179.4MB in the end (delta: -125.0MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * CodeCheck took 84410.61ms. Allocated memory was 226.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 179.4MB in the beginning and 1.2GB in the end (delta: -976.8MB). Peak memory consumption was 280.1MB. Max. memory is 16.1GB. * Witness Printer took 193.05ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 04:21:59,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a1dd6f3-39cc-42cb-b649-9c3614191f37/bin/ukojak-verify-CZk0znPC7b/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