./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/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_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/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_e87345c5-7b50-4b6b-8b8f-bd61233d9404/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 f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-24 18:25:20,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 18:25:20,346 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-24 18:25:20,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 18:25:20,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-24 18:25:20,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 18:25:20,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 18:25:20,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-24 18:25:20,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 18:25:20,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 18:25:20,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 18:25:20,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 18:25:20,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 18:25:20,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 18:25:20,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 18:25:20,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 18:25:20,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 18:25:20,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 18:25:20,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 18:25:20,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 18:25:20,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 18:25:20,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 18:25:20,392 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 18:25:20,392 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-24 18:25:20,392 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-24 18:25:20,392 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-24 18:25:20,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 18:25:20,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-24 18:25:20,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 18:25:20,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 18:25:20,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 18:25:20,394 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-24 18:25:20,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 18:25:20,394 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_e87345c5-7b50-4b6b-8b8f-bd61233d9404/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 -> f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 [2024-11-24 18:25:20,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 18:25:20,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 18:25:20,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 18:25:20,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 18:25:20,701 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 18:25:20,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2024-11-24 18:25:23,663 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/data/1f1ecc154/a62ed3e96bd94e448b9f4e3ddc796e9c/FLAGf62444a5a [2024-11-24 18:25:24,022 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 18:25:24,023 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2024-11-24 18:25:24,034 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/data/1f1ecc154/a62ed3e96bd94e448b9f4e3ddc796e9c/FLAGf62444a5a [2024-11-24 18:25:24,052 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/data/1f1ecc154/a62ed3e96bd94e448b9f4e3ddc796e9c [2024-11-24 18:25:24,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 18:25:24,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 18:25:24,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 18:25:24,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 18:25:24,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 18:25:24,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35dff9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24, skipping insertion in model container [2024-11-24 18:25:24,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 18:25:24,405 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_e87345c5-7b50-4b6b-8b8f-bd61233d9404/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2024-11-24 18:25:24,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 18:25:24,457 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 18:25:24,538 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_e87345c5-7b50-4b6b-8b8f-bd61233d9404/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2024-11-24 18:25:24,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 18:25:24,593 INFO L204 MainTranslator]: Completed translation [2024-11-24 18:25:24,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24 WrapperNode [2024-11-24 18:25:24,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 18:25:24,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 18:25:24,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 18:25:24,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 18:25:24,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,702 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-24 18:25:24,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 18:25:24,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 18:25:24,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 18:25:24,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 18:25:24,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 18:25:24,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 18:25:24,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 18:25:24,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 18:25:24,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:25:24" (1/1) ... [2024-11-24 18:25:24,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-24 18:25:24,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-24 18:25:24,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-24 18:25:24,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-24 18:25:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 18:25:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-24 18:25:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 18:25:24,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 18:25:24,977 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 18:25:24,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 18:25:26,724 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-24 18:25:26,724 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 18:25:27,164 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 18:25:27,165 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 18:25:27,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:25:27 BoogieIcfgContainer [2024-11-24 18:25:27,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 18:25:27,168 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-24 18:25:27,168 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-24 18:25:27,181 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-24 18:25:27,182 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:25:27" (1/1) ... [2024-11-24 18:25:27,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 18:25:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-24 18:25:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-24 18:25:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-24 18:25:27,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 18:25:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2024-11-24 18:25:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-11-24 18:25:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-24 18:25:28,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 18:25:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2024-11-24 18:25:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-11-24 18:25:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-24 18:25:29,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 18:25:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 167 states and 246 transitions. [2024-11-24 18:25:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2024-11-24 18:25:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-24 18:25:29,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 18:25:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 177 states and 264 transitions. [2024-11-24 18:25:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2024-11-24 18:25:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-24 18:25:30,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:30,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 18:25:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 189 states and 283 transitions. [2024-11-24 18:25:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 283 transitions. [2024-11-24 18:25:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-24 18:25:31,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 18:25:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 192 states and 286 transitions. [2024-11-24 18:25:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2024-11-24 18:25:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-24 18:25:31,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-24 18:25:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 195 states and 290 transitions. [2024-11-24 18:25:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 290 transitions. [2024-11-24 18:25:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-24 18:25:32,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:32,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 18:25:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 208 states and 313 transitions. [2024-11-24 18:25:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 313 transitions. [2024-11-24 18:25:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-24 18:25:32,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-24 18:25:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 212 states and 321 transitions. [2024-11-24 18:25:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2024-11-24 18:25:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-24 18:25:33,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-24 18:25:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 221 states and 333 transitions. [2024-11-24 18:25:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 333 transitions. [2024-11-24 18:25:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-24 18:25:34,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 18:25:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 233 states and 348 transitions. [2024-11-24 18:25:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 348 transitions. [2024-11-24 18:25:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 18:25:34,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-24 18:25:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 236 states and 355 transitions. [2024-11-24 18:25:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2024-11-24 18:25:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 18:25:35,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-24 18:25:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 239 states and 359 transitions. [2024-11-24 18:25:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 359 transitions. [2024-11-24 18:25:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 18:25:35,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:35,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:35,632 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-24 18:25:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 252 states and 383 transitions. [2024-11-24 18:25:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 383 transitions. [2024-11-24 18:25:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 18:25:36,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:36,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:36,308 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-24 18:25:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 253 states and 383 transitions. [2024-11-24 18:25:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 383 transitions. [2024-11-24 18:25:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 18:25:36,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:36,520 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-24 18:25:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 260 states and 392 transitions. [2024-11-24 18:25:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2024-11-24 18:25:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 18:25:36,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-24 18:25:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 261 states and 392 transitions. [2024-11-24 18:25:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 392 transitions. [2024-11-24 18:25:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-24 18:25:37,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-24 18:25:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 265 states and 399 transitions. [2024-11-24 18:25:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2024-11-24 18:25:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-24 18:25:38,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-24 18:25:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 272 states and 411 transitions. [2024-11-24 18:25:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 411 transitions. [2024-11-24 18:25:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-24 18:25:39,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-24 18:25:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 278 states and 418 transitions. [2024-11-24 18:25:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 418 transitions. [2024-11-24 18:25:39,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-24 18:25:39,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-24 18:25:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 282 states and 423 transitions. [2024-11-24 18:25:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 423 transitions. [2024-11-24 18:25:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-24 18:25:40,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 18:25:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 301 states and 448 transitions. [2024-11-24 18:25:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 448 transitions. [2024-11-24 18:25:41,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-24 18:25:41,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:41,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 18:25:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 309 states and 457 transitions. [2024-11-24 18:25:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 457 transitions. [2024-11-24 18:25:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-24 18:25:41,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:41,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 18:25:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 18:25:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-24 18:25:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 310 states and 457 transitions. [2024-11-24 18:25:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 457 transitions. [2024-11-24 18:25:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-24 18:25:41,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-24 18:25:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 18:25:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 18:25:41,585 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 18:25:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 18:25:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 18:25:41,745 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 18:25:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 18:25:41,829 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 25 iterations. [2024-11-24 18:25:41,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 24.11 06:25:41 ImpRootNode [2024-11-24 18:25:41,936 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-24 18:25:41,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 18:25:41,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 18:25:41,937 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 18:25:41,937 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:25:27" (3/4) ... [2024-11-24 18:25:41,938 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-24 18:25:42,074 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 112. [2024-11-24 18:25:42,209 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-24 18:25:42,210 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-24 18:25:42,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 18:25:42,211 INFO L158 Benchmark]: Toolchain (without parser) took 18153.01ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 115.8MB in the beginning and 132.1MB in the end (delta: -16.3MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. [2024-11-24 18:25:42,211 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 18:25:42,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.18ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 90.0MB in the end (delta: 25.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 18:25:42,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.13ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 84.9MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 18:25:42,212 INFO L158 Benchmark]: Boogie Preprocessor took 74.87ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 80.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 18:25:42,212 INFO L158 Benchmark]: RCFGBuilder took 2386.42ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 78.9MB in the end (delta: 1.9MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-24 18:25:42,213 INFO L158 Benchmark]: CodeCheck took 14768.01ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 78.9MB in the beginning and 148.9MB in the end (delta: -70.0MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2024-11-24 18:25:42,213 INFO L158 Benchmark]: Witness Printer took 273.50ms. Allocated memory is still 268.4MB. Free memory was 148.9MB in the beginning and 132.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 18:25:42,219 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 25, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10548 SdHoareTripleChecker+Valid, 38.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8566 mSDsluCounter, 2113 SdHoareTripleChecker+Invalid, 32.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1691 mSDsCounter, 5603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21267 IncrementalHoareTripleChecker+Invalid, 26870 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5603 mSolverCounterUnsat, 422 mSDtfsCounter, 21267 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16007 GetRequests, 15695 SyntacticMatches, 134 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15654 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2498 NumberOfCodeBlocks, 2498 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2367 ConstructedInterpolants, 0 QuantifiedInterpolants, 3393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 608/616 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: 443]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [\result=26, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L110] a17 = 7 [L111] a25 = 0 [L112] a11 = 1 [L113] a28 = 10 [L114] a19 = 0 [L115] return -1; VAL [\result=-1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L442] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L443] reach_error() VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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.41ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.18ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 90.0MB in the end (delta: 25.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.13ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 84.9MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.87ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 80.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2386.42ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 78.9MB in the end (delta: 1.9MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * CodeCheck took 14768.01ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 78.9MB in the beginning and 148.9MB in the end (delta: -70.0MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * Witness Printer took 273.50ms. Allocated memory is still 268.4MB. Free memory was 148.9MB in the beginning and 132.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-24 18:25:42,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e87345c5-7b50-4b6b-8b8f-bd61233d9404/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