./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.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_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3 --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 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 05:12:12,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 05:12:12,124 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 05:12:12,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 05:12:12,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 05:12:12,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 05:12:12,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 05:12:12,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 05:12:12,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 05:12:12,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 05:12:12,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 05:12:12,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 05:12:12,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 05:12:12,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 05:12:12,172 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 05:12:12,172 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 05:12:12,172 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 05:12:12,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 05:12:12,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:12:12,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 05:12:12,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 05:12:12,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 05:12:12,172 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 05:12:12,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 05:12:12,173 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_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3 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 -> 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd [2024-11-25 05:12:12,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 05:12:12,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 05:12:12,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 05:12:12,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 05:12:12,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 05:12:12,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2024-11-25 05:12:15,467 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/data/87c82a8a2/759582e6be634cd2a3099597ba9a0dc3/FLAG6b2fe473c [2024-11-25 05:12:15,866 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 05:12:15,869 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2024-11-25 05:12:15,888 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/data/87c82a8a2/759582e6be634cd2a3099597ba9a0dc3/FLAG6b2fe473c [2024-11-25 05:12:15,907 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/data/87c82a8a2/759582e6be634cd2a3099597ba9a0dc3 [2024-11-25 05:12:15,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 05:12:15,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 05:12:15,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 05:12:15,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 05:12:15,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 05:12:15,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:15" (1/1) ... [2024-11-25 05:12:15,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0a7f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:15, skipping insertion in model container [2024-11-25 05:12:15,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:15" (1/1) ... [2024-11-25 05:12:15,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 05:12:16,296 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_bb7dadb6-3545-4e27-ad16-381c35e023dd/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2024-11-25 05:12:16,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:12:16,357 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 05:12:16,442 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_bb7dadb6-3545-4e27-ad16-381c35e023dd/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2024-11-25 05:12:16,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:12:16,489 INFO L204 MainTranslator]: Completed translation [2024-11-25 05:12:16,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16 WrapperNode [2024-11-25 05:12:16,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 05:12:16,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 05:12:16,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 05:12:16,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 05:12:16,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,590 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 05:12:16,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 05:12:16,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 05:12:16,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 05:12:16,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 05:12:16,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 05:12:16,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 05:12:16,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 05:12:16,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 05:12:16,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16" (1/1) ... [2024-11-25 05:12:16,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:12:16,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 05:12:16,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 05:12:16,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 05:12:16,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 05:12:16,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 05:12:16,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 05:12:16,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 05:12:16,826 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 05:12:16,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 05:12:18,118 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 05:12:18,118 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 05:12:18,547 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 05:12:18,547 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 05:12:18,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:18 BoogieIcfgContainer [2024-11-25 05:12:18,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 05:12:18,548 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 05:12:18,548 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 05:12:18,560 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 05:12:18,560 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:18" (1/1) ... [2024-11-25 05:12:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 05:12:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 05:12:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 05:12:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 05:12:18,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:18,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2024-11-25 05:12:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2024-11-25 05:12:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 05:12:19,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:19,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2024-11-25 05:12:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2024-11-25 05:12:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 05:12:21,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 05:12:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2024-11-25 05:12:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2024-11-25 05:12:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-25 05:12:21,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 231 states and 323 transitions. [2024-11-25 05:12:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2024-11-25 05:12:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-25 05:12:21,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 235 states and 330 transitions. [2024-11-25 05:12:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 330 transitions. [2024-11-25 05:12:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-25 05:12:22,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 240 states and 335 transitions. [2024-11-25 05:12:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2024-11-25 05:12:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 05:12:22,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 256 states and 356 transitions. [2024-11-25 05:12:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 356 transitions. [2024-11-25 05:12:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 05:12:23,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 282 states and 386 transitions. [2024-11-25 05:12:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 386 transitions. [2024-11-25 05:12:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 05:12:24,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 05:12:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 293 states and 401 transitions. [2024-11-25 05:12:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 401 transitions. [2024-11-25 05:12:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 05:12:24,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 05:12:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 314 states and 426 transitions. [2024-11-25 05:12:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 426 transitions. [2024-11-25 05:12:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-25 05:12:25,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 05:12:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 317 states and 430 transitions. [2024-11-25 05:12:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 430 transitions. [2024-11-25 05:12:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-25 05:12:26,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:26,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 05:12:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 328 states and 442 transitions. [2024-11-25 05:12:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 442 transitions. [2024-11-25 05:12:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 05:12:26,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 05:12:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 330 states and 444 transitions. [2024-11-25 05:12:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 444 transitions. [2024-11-25 05:12:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 05:12:26,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 05:12:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 333 states and 449 transitions. [2024-11-25 05:12:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 449 transitions. [2024-11-25 05:12:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-25 05:12:27,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 05:12:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 348 states and 467 transitions. [2024-11-25 05:12:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 467 transitions. [2024-11-25 05:12:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 05:12:27,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 05:12:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 357 states and 479 transitions. [2024-11-25 05:12:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 479 transitions. [2024-11-25 05:12:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 05:12:28,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:28,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 05:12:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 361 states and 487 transitions. [2024-11-25 05:12:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 487 transitions. [2024-11-25 05:12:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 05:12:29,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 375 states and 501 transitions. [2024-11-25 05:12:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 501 transitions. [2024-11-25 05:12:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 05:12:29,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:29,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 05:12:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 384 states and 511 transitions. [2024-11-25 05:12:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 511 transitions. [2024-11-25 05:12:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-25 05:12:29,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:29,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 408 states and 536 transitions. [2024-11-25 05:12:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 536 transitions. [2024-11-25 05:12:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-25 05:12:30,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 441 states and 571 transitions. [2024-11-25 05:12:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 571 transitions. [2024-11-25 05:12:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 05:12:30,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 05:12:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 463 states and 595 transitions. [2024-11-25 05:12:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 595 transitions. [2024-11-25 05:12:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-25 05:12:31,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:31,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 479 states and 620 transitions. [2024-11-25 05:12:32,198 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 620 transitions. [2024-11-25 05:12:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-25 05:12:32,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:32,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 508 states and 651 transitions. [2024-11-25 05:12:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 651 transitions. [2024-11-25 05:12:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-25 05:12:32,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 05:12:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 552 states and 696 transitions. [2024-11-25 05:12:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 696 transitions. [2024-11-25 05:12:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-25 05:12:33,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 05:12:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 560 states and 706 transitions. [2024-11-25 05:12:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 706 transitions. [2024-11-25 05:12:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-25 05:12:33,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:33,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-25 05:12:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 593 states and 744 transitions. [2024-11-25 05:12:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 744 transitions. [2024-11-25 05:12:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-25 05:12:35,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:35,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 05:12:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 598 states and 749 transitions. [2024-11-25 05:12:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 749 transitions. [2024-11-25 05:12:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-25 05:12:35,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:35,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-25 05:12:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 601 states and 753 transitions. [2024-11-25 05:12:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 753 transitions. [2024-11-25 05:12:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 05:12:36,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 629 states and 784 transitions. [2024-11-25 05:12:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 784 transitions. [2024-11-25 05:12:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 05:12:37,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:12:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 630 states and 784 transitions. [2024-11-25 05:12:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 784 transitions. [2024-11-25 05:12:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 05:12:37,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 702 states and 873 transitions. [2024-11-25 05:12:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 873 transitions. [2024-11-25 05:12:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-25 05:12:39,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:39,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 05:12:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 739 states and 915 transitions. [2024-11-25 05:12:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 915 transitions. [2024-11-25 05:12:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-25 05:12:41,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 05:12:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 758 states and 936 transitions. [2024-11-25 05:12:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 936 transitions. [2024-11-25 05:12:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-25 05:12:42,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-25 05:12:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 759 states and 936 transitions. [2024-11-25 05:12:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 936 transitions. [2024-11-25 05:12:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-25 05:12:42,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 803 states and 981 transitions. [2024-11-25 05:12:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 981 transitions. [2024-11-25 05:12:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 05:12:43,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:43,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 05:12:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 806 states and 985 transitions. [2024-11-25 05:12:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 985 transitions. [2024-11-25 05:12:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 05:12:44,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:12:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 807 states and 987 transitions. [2024-11-25 05:12:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 987 transitions. [2024-11-25 05:12:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-25 05:12:44,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 05:12:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 809 states and 989 transitions. [2024-11-25 05:12:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 989 transitions. [2024-11-25 05:12:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-25 05:12:45,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 05:12:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 812 states and 992 transitions. [2024-11-25 05:12:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 992 transitions. [2024-11-25 05:12:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 05:12:45,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-25 05:12:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 815 states and 996 transitions. [2024-11-25 05:12:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 996 transitions. [2024-11-25 05:12:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 05:12:46,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 896 states and 1097 transitions. [2024-11-25 05:12:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1097 transitions. [2024-11-25 05:12:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 05:12:49,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 899 states and 1100 transitions. [2024-11-25 05:12:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1100 transitions. [2024-11-25 05:12:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-25 05:12:49,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-25 05:12:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 926 states and 1133 transitions. [2024-11-25 05:12:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1133 transitions. [2024-11-25 05:12:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-25 05:12:50,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-25 05:12:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 927 states and 1133 transitions. [2024-11-25 05:12:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1133 transitions. [2024-11-25 05:12:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-25 05:12:50,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:50,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1011 states and 1229 transitions. [2024-11-25 05:12:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1229 transitions. [2024-11-25 05:12:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 05:12:53,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 05:12:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1082 states and 1300 transitions. [2024-11-25 05:12:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1300 transitions. [2024-11-25 05:12:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-25 05:12:55,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:12:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1083 states and 1301 transitions. [2024-11-25 05:12:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1301 transitions. [2024-11-25 05:12:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-25 05:12:55,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 05:12:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1084 states and 1302 transitions. [2024-11-25 05:12:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1302 transitions. [2024-11-25 05:12:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-25 05:12:55,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:12:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1106 states and 1324 transitions. [2024-11-25 05:12:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1324 transitions. [2024-11-25 05:12:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-25 05:12:56,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 99 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 05:12:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1118 states and 1338 transitions. [2024-11-25 05:12:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1338 transitions. [2024-11-25 05:12:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 05:12:57,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 05:12:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1139 states and 1366 transitions. [2024-11-25 05:12:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1366 transitions. [2024-11-25 05:12:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 05:12:58,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1172 states and 1402 transitions. [2024-11-25 05:13:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1402 transitions. [2024-11-25 05:13:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-25 05:13:00,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 05:13:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1188 states and 1420 transitions. [2024-11-25 05:13:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1420 transitions. [2024-11-25 05:13:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-25 05:13:00,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:00,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-25 05:13:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1195 states and 1428 transitions. [2024-11-25 05:13:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1428 transitions. [2024-11-25 05:13:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 05:13:01,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-25 05:13:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1220 states and 1453 transitions. [2024-11-25 05:13:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1453 transitions. [2024-11-25 05:13:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:13:01,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:01,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1298 states and 1553 transitions. [2024-11-25 05:13:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1553 transitions. [2024-11-25 05:13:06,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:13:06,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:06,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1303 states and 1557 transitions. [2024-11-25 05:13:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1557 transitions. [2024-11-25 05:13:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:13:06,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:06,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1311 states and 1565 transitions. [2024-11-25 05:13:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1565 transitions. [2024-11-25 05:13:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:13:07,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1320 states and 1574 transitions. [2024-11-25 05:13:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1574 transitions. [2024-11-25 05:13:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-25 05:13:08,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 05:13:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1342 states and 1601 transitions. [2024-11-25 05:13:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1601 transitions. [2024-11-25 05:13:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-25 05:13:10,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:10,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 05:13:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1370 states and 1631 transitions. [2024-11-25 05:13:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1631 transitions. [2024-11-25 05:13:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-25 05:13:12,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 05:13:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1372 states and 1634 transitions. [2024-11-25 05:13:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1634 transitions. [2024-11-25 05:13:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 05:13:12,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 05:13:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1381 states and 1644 transitions. [2024-11-25 05:13:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1644 transitions. [2024-11-25 05:13:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 05:13:13,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:13,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1455 states and 1732 transitions. [2024-11-25 05:13:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1732 transitions. [2024-11-25 05:13:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 05:13:17,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1458 states and 1735 transitions. [2024-11-25 05:13:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1735 transitions. [2024-11-25 05:13:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 05:13:18,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1502 states and 1791 transitions. [2024-11-25 05:13:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1791 transitions. [2024-11-25 05:13:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 05:13:22,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:22,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:13:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1509 states and 1799 transitions. [2024-11-25 05:13:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1799 transitions. [2024-11-25 05:13:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 05:13:23,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 05:13:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1516 states and 1806 transitions. [2024-11-25 05:13:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1806 transitions. [2024-11-25 05:13:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 05:13:23,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:13:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1558 states and 1855 transitions. [2024-11-25 05:13:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1855 transitions. [2024-11-25 05:13:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 05:13:27,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:27,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:13:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1564 states and 1861 transitions. [2024-11-25 05:13:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1861 transitions. [2024-11-25 05:13:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 05:13:27,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:27,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:13:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1566 states and 1862 transitions. [2024-11-25 05:13:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1862 transitions. [2024-11-25 05:13:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 05:13:28,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:28,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-25 05:13:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1580 states and 1885 transitions. [2024-11-25 05:13:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1885 transitions. [2024-11-25 05:13:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 05:13:30,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:30,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-25 05:13:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1592 states and 1901 transitions. [2024-11-25 05:13:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1901 transitions. [2024-11-25 05:13:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 05:13:32,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-25 05:13:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1594 states and 1905 transitions. [2024-11-25 05:13:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1905 transitions. [2024-11-25 05:13:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 05:13:33,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:33,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-25 05:13:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1596 states and 1906 transitions. [2024-11-25 05:13:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1906 transitions. [2024-11-25 05:13:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:13:34,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:34,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 05:13:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1599 states and 1910 transitions. [2024-11-25 05:13:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 1910 transitions. [2024-11-25 05:13:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:13:35,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:35,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:13:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1650 states and 1971 transitions. [2024-11-25 05:13:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1971 transitions. [2024-11-25 05:13:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:13:38,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:38,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:13:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1653 states and 1974 transitions. [2024-11-25 05:13:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1974 transitions. [2024-11-25 05:13:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-25 05:13:39,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 171 proven. 76 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 05:13:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1668 states and 1994 transitions. [2024-11-25 05:13:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1994 transitions. [2024-11-25 05:13:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:13:40,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 05:13:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1703 states and 2037 transitions. [2024-11-25 05:13:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2037 transitions. [2024-11-25 05:13:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:13:43,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 05:13:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 1720 states and 2053 transitions. [2024-11-25 05:13:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2053 transitions. [2024-11-25 05:13:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:13:45,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:45,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 190 proven. 58 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-25 05:13:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 1726 states and 2064 transitions. [2024-11-25 05:13:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2064 transitions. [2024-11-25 05:13:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:13:47,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 05:13:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 1729 states and 2067 transitions. [2024-11-25 05:13:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2067 transitions. [2024-11-25 05:13:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 05:13:48,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-25 05:13:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 1747 states and 2086 transitions. [2024-11-25 05:13:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2086 transitions. [2024-11-25 05:13:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 05:13:50,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:50,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-25 05:13:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1756 states and 2094 transitions. [2024-11-25 05:13:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2094 transitions. [2024-11-25 05:13:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 05:13:50,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:13:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 1890 states and 2249 transitions. [2024-11-25 05:13:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2249 transitions. [2024-11-25 05:13:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:13:57,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 05:13:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 1896 states and 2255 transitions. [2024-11-25 05:13:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2255 transitions. [2024-11-25 05:13:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:13:58,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:58,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 181 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 05:13:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1901 states and 2262 transitions. [2024-11-25 05:13:59,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2262 transitions. [2024-11-25 05:13:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:13:59,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 181 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 05:13:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 1916 states and 2278 transitions. [2024-11-25 05:13:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2278 transitions. [2024-11-25 05:13:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:13:59,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:14:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 1929 states and 2291 transitions. [2024-11-25 05:14:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2291 transitions. [2024-11-25 05:14:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 05:14:01,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:14:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2003 states and 2369 transitions. [2024-11-25 05:14:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2369 transitions. [2024-11-25 05:14:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 05:14:03,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-25 05:14:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2004 states and 2371 transitions. [2024-11-25 05:14:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2371 transitions. [2024-11-25 05:14:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 05:14:03,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:03,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-25 05:14:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2019 states and 2386 transitions. [2024-11-25 05:14:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2386 transitions. [2024-11-25 05:14:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 05:14:04,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-25 05:14:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2031 states and 2398 transitions. [2024-11-25 05:14:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2398 transitions. [2024-11-25 05:14:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 05:14:05,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:05,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 05:14:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2042 states and 2418 transitions. [2024-11-25 05:14:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2418 transitions. [2024-11-25 05:14:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 05:14:07,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:07,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 05:14:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2053 states and 2436 transitions. [2024-11-25 05:14:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2436 transitions. [2024-11-25 05:14:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 05:14:09,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 05:14:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2069 states and 2452 transitions. [2024-11-25 05:14:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2452 transitions. [2024-11-25 05:14:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 05:14:10,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 05:14:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2074 states and 2457 transitions. [2024-11-25 05:14:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2457 transitions. [2024-11-25 05:14:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-25 05:14:11,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:14:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2075 states and 2459 transitions. [2024-11-25 05:14:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2459 transitions. [2024-11-25 05:14:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-25 05:14:12,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:12,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:14:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2090 states and 2475 transitions. [2024-11-25 05:14:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2475 transitions. [2024-11-25 05:14:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-25 05:14:12,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 05:14:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2127 states and 2522 transitions. [2024-11-25 05:14:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2522 transitions. [2024-11-25 05:14:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 05:14:15,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-25 05:14:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2129 states and 2526 transitions. [2024-11-25 05:14:16,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2526 transitions. [2024-11-25 05:14:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 05:14:16,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-25 05:14:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2131 states and 2528 transitions. [2024-11-25 05:14:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2528 transitions. [2024-11-25 05:14:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 05:14:16,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-25 05:14:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2147 states and 2544 transitions. [2024-11-25 05:14:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2544 transitions. [2024-11-25 05:14:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 05:14:17,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-25 05:14:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2148 states and 2544 transitions. [2024-11-25 05:14:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2544 transitions. [2024-11-25 05:14:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 05:14:17,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-25 05:14:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2149 states and 2544 transitions. [2024-11-25 05:14:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2544 transitions. [2024-11-25 05:14:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 05:14:18,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:18,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:14:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2178 states and 2576 transitions. [2024-11-25 05:14:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2576 transitions. [2024-11-25 05:14:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 05:14:21,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:21,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 05:14:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2181 states and 2579 transitions. [2024-11-25 05:14:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2579 transitions. [2024-11-25 05:14:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-25 05:14:22,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:22,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 192 proven. 59 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:14:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2182 states and 2580 transitions. [2024-11-25 05:14:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2580 transitions. [2024-11-25 05:14:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 05:14:23,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:23,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 05:14:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2196 states and 2595 transitions. [2024-11-25 05:14:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2595 transitions. [2024-11-25 05:14:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 05:14:25,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 05:14:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2210 states and 2610 transitions. [2024-11-25 05:14:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2610 transitions. [2024-11-25 05:14:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-25 05:14:26,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 229 proven. 105 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 05:14:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2239 states and 2650 transitions. [2024-11-25 05:14:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2650 transitions. [2024-11-25 05:14:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 05:14:27,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:27,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 05:14:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2253 states and 2664 transitions. [2024-11-25 05:14:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 2664 transitions. [2024-11-25 05:14:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 05:14:28,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:14:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2256 states and 2668 transitions. [2024-11-25 05:14:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2668 transitions. [2024-11-25 05:14:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 05:14:29,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-25 05:14:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2285 states and 2696 transitions. [2024-11-25 05:14:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2696 transitions. [2024-11-25 05:14:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 05:14:30,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:30,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 65 proven. 278 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:14:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2355 states and 2768 transitions. [2024-11-25 05:14:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2768 transitions. [2024-11-25 05:14:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:14:32,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-25 05:14:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2358 states and 2772 transitions. [2024-11-25 05:14:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2772 transitions. [2024-11-25 05:14:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:14:33,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:33,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2425 states and 2853 transitions. [2024-11-25 05:14:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 2853 transitions. [2024-11-25 05:14:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:14:40,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2472 states and 2906 transitions. [2024-11-25 05:14:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 2906 transitions. [2024-11-25 05:14:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:14:47,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2481 states and 2915 transitions. [2024-11-25 05:14:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 2915 transitions. [2024-11-25 05:14:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:14:48,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2489 states and 2923 transitions. [2024-11-25 05:14:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 2923 transitions. [2024-11-25 05:14:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 05:14:49,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2498 states and 2932 transitions. [2024-11-25 05:14:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 2932 transitions. [2024-11-25 05:14:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 05:14:50,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-25 05:14:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2522 states and 2959 transitions. [2024-11-25 05:14:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 2959 transitions. [2024-11-25 05:14:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:14:53,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 2568 states and 3013 transitions. [2024-11-25 05:14:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3013 transitions. [2024-11-25 05:14:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-25 05:14:57,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:57,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 05:14:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 2571 states and 3016 transitions. [2024-11-25 05:14:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3016 transitions. [2024-11-25 05:14:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:14:58,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:15:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 2596 states and 3044 transitions. [2024-11-25 05:15:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 3044 transitions. [2024-11-25 05:15:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:15:03,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:15:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:15:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:15:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 2667 states and 3121 transitions. [2024-11-25 05:15:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3121 transitions. [2024-11-25 05:15:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-25 05:15:11,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:15:11,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:15:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:15:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 2674 states and 3128 transitions. [2024-11-25 05:15:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3128 transitions. [2024-11-25 05:15:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-25 05:15:11,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:15:11,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:15:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 251 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:15:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 2682 states and 3140 transitions. [2024-11-25 05:15:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 3140 transitions. [2024-11-25 05:15:13,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 05:15:13,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:15:13,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:15:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:15:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 2713 states and 3173 transitions. [2024-11-25 05:15:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3173 transitions. [2024-11-25 05:15:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:15:16,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:15:16,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:15:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:15:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 2716 states and 3177 transitions. [2024-11-25 05:15:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3177 transitions. [2024-11-25 05:15:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:15:17,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:15:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:15:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 05:15:17,454 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 05:15:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 05:15:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 05:15:17,720 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 05:15:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 05:15:17,928 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 133 iterations. [2024-11-25 05:15:18,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 05:15:18 ImpRootNode [2024-11-25 05:15:18,108 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 05:15:18,108 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 05:15:18,108 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 05:15:18,109 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 05:15:18,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:18" (3/4) ... [2024-11-25 05:15:18,110 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 05:15:18,317 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 265. [2024-11-25 05:15:18,530 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 05:15:18,530 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 05:15:18,530 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 05:15:18,534 INFO L158 Benchmark]: Toolchain (without parser) took 182620.09ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 116.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 451.4MB. Max. memory is 16.1GB. [2024-11-25 05:15:18,534 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:15:18,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.84ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 89.4MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 05:15:18,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.68ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 83.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 05:15:18,536 INFO L158 Benchmark]: Boogie Preprocessor took 67.04ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 79.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:15:18,537 INFO L158 Benchmark]: RCFGBuilder took 1889.20ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 79.7MB in the beginning and 346.5MB in the end (delta: -266.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-11-25 05:15:18,538 INFO L158 Benchmark]: CodeCheck took 179559.49ms. Allocated memory was 427.8MB in the beginning and 2.3GB in the end (delta: 1.9GB). Free memory was 346.5MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 358.1MB. Max. memory is 16.1GB. [2024-11-25 05:15:18,539 INFO L158 Benchmark]: Witness Printer took 422.08ms. Allocated memory is still 2.3GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-25 05:15:18,540 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: 179.3s, OverallIterations: 133, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377747 SdHoareTripleChecker+Valid, 1075.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376698 mSDsluCounter, 65365 SdHoareTripleChecker+Invalid, 917.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56571 mSDsCounter, 93838 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 812713 IncrementalHoareTripleChecker+Invalid, 906551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93838 mSolverCounterUnsat, 8794 mSDtfsCounter, 812713 mSolverCounterSat, 12.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159131 GetRequests, 151518 SyntacticMatches, 6579 SemanticMatches, 1034 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806531 ImplicationChecksByTransitivity, 122.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 31.4s InterpolantComputationTime, 24502 NumberOfCodeBlocks, 24502 NumberOfCodeBlocksAsserted, 133 NumberOfCheckSat, 24115 ConstructedInterpolants, 0 QuantifiedInterpolants, 146546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 132 InterpolantComputations, 57 PerfectInterpolantSequences, 21532/26335 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: 435]: 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND TRUE ((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))))))) [L393] a20 = 0 [L394] a21 = 1 [L395] a8 = 14 [L396] a17 = 0 [L397] a16 = 5 [L398] a7 = 1 [L399] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L434] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L435] reach_error() VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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.37ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.84ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 89.4MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.68ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 83.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.04ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 79.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1889.20ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 79.7MB in the beginning and 346.5MB in the end (delta: -266.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * CodeCheck took 179559.49ms. Allocated memory was 427.8MB in the beginning and 2.3GB in the end (delta: 1.9GB). Free memory was 346.5MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 358.1MB. Max. memory is 16.1GB. * Witness Printer took 422.08ms. Allocated memory is still 2.3GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 05:15:18,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb7dadb6-3545-4e27-ad16-381c35e023dd/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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