./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.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_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/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_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/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_0904552d-33ab-455c-81da-70eb5844f2f8/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 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:11:42,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:11:42,306 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:11:42,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:11:42,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:11:42,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:11:42,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:11:42,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:11:42,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:11:42,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:11:42,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:11:42,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:11:42,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:11:42,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:11:42,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:11:42,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:11:42,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:11:42,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:11:42,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:11:42,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:11:42,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:11:42,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:11:42,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:11:42,336 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:11:42,336 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:11:42,337 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:11:42,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:11:42,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:11:42,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:11:42,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:11:42,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:11:42,338 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:11:42,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:11:42,338 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_0904552d-33ab-455c-81da-70eb5844f2f8/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 -> 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 [2024-11-25 03:11:42,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:11:42,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:11:42,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:11:42,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:11:42,653 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:11:42,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2024-11-25 03:11:45,701 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/data/97bcbd7ce/ae4bf9993e0d414a8f1e93b2c1bdeb57/FLAG98eedb9eb [2024-11-25 03:11:46,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:11:46,117 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2024-11-25 03:11:46,129 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/data/97bcbd7ce/ae4bf9993e0d414a8f1e93b2c1bdeb57/FLAG98eedb9eb [2024-11-25 03:11:46,155 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/data/97bcbd7ce/ae4bf9993e0d414a8f1e93b2c1bdeb57 [2024-11-25 03:11:46,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:11:46,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:11:46,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:11:46,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:11:46,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:11:46,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642344f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46, skipping insertion in model container [2024-11-25 03:11:46,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:11:46,647 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_0904552d-33ab-455c-81da-70eb5844f2f8/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-11-25 03:11:46,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:11:46,700 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:11:46,825 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_0904552d-33ab-455c-81da-70eb5844f2f8/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-11-25 03:11:46,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:11:46,847 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:11:46,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46 WrapperNode [2024-11-25 03:11:46,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:11:46,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:11:46,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:11:46,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:11:46,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,926 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 03:11:46,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:11:46,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:11:46,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:11:46,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:11:46,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:46,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:11:46,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:11:46,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:11:46,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:11:46,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:11:46" (1/1) ... [2024-11-25 03:11:47,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:11:47,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:11:47,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:11:47,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:11:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:11:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:11:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:11:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:11:47,162 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:11:47,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:11:48,533 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 03:11:48,533 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:11:48,871 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:11:48,874 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 03:11:48,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:11:48 BoogieIcfgContainer [2024-11-25 03:11:48,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:11:48,875 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:11:48,875 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:11:48,890 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:11:48,890 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:11:48" (1/1) ... [2024-11-25 03:11:48,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:11:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 03:11:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 03:11:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 03:11:48,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:50,048 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 03:11:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-25 03:11:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-25 03:11:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 03:11:50,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:51,120 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 03:11:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-25 03:11:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-25 03:11:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 03:11:52,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:11:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-25 03:11:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-25 03:11:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 03:11:53,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:11:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-25 03:11:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-25 03:11:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-25 03:11:54,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:54,905 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-25 03:11:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-25 03:11:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-25 03:11:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 03:11:55,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:11:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-25 03:11:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-25 03:11:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 03:11:55,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:55,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:11:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-25 03:11:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-25 03:11:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 03:11:57,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:57,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:11:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-25 03:11:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-25 03:11:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 03:11:58,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:11:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:11:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-25 03:11:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-25 03:11:59,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-25 03:11:59,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:11:59,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:11:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:11:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:12:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-25 03:12:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-25 03:12:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 03:12:00,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 03:12:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-25 03:12:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-25 03:12:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 03:12:01,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:01,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:12:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-25 03:12:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-25 03:12:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 03:12:03,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:12:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-25 03:12:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-25 03:12:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 03:12:04,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:04,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:12:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 511 states and 629 transitions. [2024-11-25 03:12:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 629 transitions. [2024-11-25 03:12:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 03:12:05,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 03:12:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 512 states and 629 transitions. [2024-11-25 03:12:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 629 transitions. [2024-11-25 03:12:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 03:12:05,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:06,067 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 03:12:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 581 states and 713 transitions. [2024-11-25 03:12:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 713 transitions. [2024-11-25 03:12:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 03:12:07,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:12:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 600 states and 736 transitions. [2024-11-25 03:12:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 736 transitions. [2024-11-25 03:12:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 03:12:09,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:12:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 602 states and 737 transitions. [2024-11-25 03:12:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 737 transitions. [2024-11-25 03:12:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 03:12:09,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:09,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 03:12:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-25 03:12:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-25 03:12:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 03:12:10,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:10,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:12:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 645 states and 784 transitions. [2024-11-25 03:12:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 784 transitions. [2024-11-25 03:12:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-25 03:12:11,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 03:12:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 670 states and 809 transitions. [2024-11-25 03:12:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 809 transitions. [2024-11-25 03:12:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 03:12:11,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:11,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:12:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 672 states and 810 transitions. [2024-11-25 03:12:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 810 transitions. [2024-11-25 03:12:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 03:12:12,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:12:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 718 states and 868 transitions. [2024-11-25 03:12:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 868 transitions. [2024-11-25 03:12:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 03:12:13,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:12:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 733 states and 887 transitions. [2024-11-25 03:12:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 887 transitions. [2024-11-25 03:12:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 03:12:14,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:12:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 817 states and 985 transitions. [2024-11-25 03:12:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 985 transitions. [2024-11-25 03:12:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 03:12:18,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:18,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:18,678 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 03:12:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 869 states and 1051 transitions. [2024-11-25 03:12:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1051 transitions. [2024-11-25 03:12:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 03:12:20,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:20,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:12:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 931 states and 1123 transitions. [2024-11-25 03:12:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1123 transitions. [2024-11-25 03:12:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 03:12:22,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:22,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:12:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 933 states and 1124 transitions. [2024-11-25 03:12:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1124 transitions. [2024-11-25 03:12:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:12:23,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:23,998 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 03:12:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1009 states and 1218 transitions. [2024-11-25 03:12:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1218 transitions. [2024-11-25 03:12:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:12:26,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:26,506 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 03:12:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1028 states and 1239 transitions. [2024-11-25 03:12:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1239 transitions. [2024-11-25 03:12:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:12:27,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-25 03:12:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1051 states and 1265 transitions. [2024-11-25 03:12:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1265 transitions. [2024-11-25 03:12:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 03:12:28,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 03:12:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1066 states and 1284 transitions. [2024-11-25 03:12:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1284 transitions. [2024-11-25 03:12:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-25 03:12:29,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:12:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1158 states and 1380 transitions. [2024-11-25 03:12:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1380 transitions. [2024-11-25 03:12:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:12:31,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:31,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:32,206 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 03:12:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1199 states and 1427 transitions. [2024-11-25 03:12:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1427 transitions. [2024-11-25 03:12:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:12:33,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:34,052 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 03:12:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1232 states and 1465 transitions. [2024-11-25 03:12:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1465 transitions. [2024-11-25 03:12:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:12:35,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:35,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:35,431 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 03:12:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1233 states and 1466 transitions. [2024-11-25 03:12:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1466 transitions. [2024-11-25 03:12:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 03:12:35,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:35,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:36,290 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 03:12:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1293 states and 1539 transitions. [2024-11-25 03:12:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1539 transitions. [2024-11-25 03:12:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:12:37,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:12:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1331 states and 1582 transitions. [2024-11-25 03:12:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1582 transitions. [2024-11-25 03:12:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:12:39,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:39,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:39,576 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 03:12:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1353 states and 1611 transitions. [2024-11-25 03:12:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1611 transitions. [2024-11-25 03:12:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:12:41,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:41,649 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 03:12:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1386 states and 1646 transitions. [2024-11-25 03:12:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1646 transitions. [2024-11-25 03:12:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 03:12:43,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:43,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:12:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1411 states and 1676 transitions. [2024-11-25 03:12:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1676 transitions. [2024-11-25 03:12:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 03:12:46,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:46,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:12:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1427 states and 1692 transitions. [2024-11-25 03:12:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1692 transitions. [2024-11-25 03:12:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:12:47,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:48,659 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 03:12:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1474 states and 1754 transitions. [2024-11-25 03:12:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1754 transitions. [2024-11-25 03:12:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:12:51,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:51,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:51,645 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 03:12:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1483 states and 1762 transitions. [2024-11-25 03:12:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1762 transitions. [2024-11-25 03:12:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:12:52,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:52,788 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 03:12:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1500 states and 1783 transitions. [2024-11-25 03:12:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1783 transitions. [2024-11-25 03:12:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:12:54,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:54,440 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 03:12:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1503 states and 1786 transitions. [2024-11-25 03:12:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1786 transitions. [2024-11-25 03:12:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 03:12:54,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:54,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:12:55,617 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 03:12:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:12:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1637 states and 1938 transitions. [2024-11-25 03:12:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 1938 transitions. [2024-11-25 03:12:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 03:12:59,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:12:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:12:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:00,395 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 03:13:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1665 states and 1967 transitions. [2024-11-25 03:13:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1967 transitions. [2024-11-25 03:13:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 03:13:01,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:01,842 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 03:13:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1678 states and 1982 transitions. [2024-11-25 03:13:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1982 transitions. [2024-11-25 03:13:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 03:13:02,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:02,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:02,816 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 03:13:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1681 states and 1986 transitions. [2024-11-25 03:13:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 1986 transitions. [2024-11-25 03:13:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 03:13:03,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 03:13:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 1769 states and 2086 transitions. [2024-11-25 03:13:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2086 transitions. [2024-11-25 03:13:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 03:13:06,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:07,220 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 03:13:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 1843 states and 2162 transitions. [2024-11-25 03:13:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2162 transitions. [2024-11-25 03:13:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 03:13:08,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 03:13:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 1864 states and 2184 transitions. [2024-11-25 03:13:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2184 transitions. [2024-11-25 03:13:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-25 03:13:11,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:11,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-25 03:13:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 1866 states and 2186 transitions. [2024-11-25 03:13:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2186 transitions. [2024-11-25 03:13:11,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 03:13:11,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:12,338 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 03:13:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 1881 states and 2203 transitions. [2024-11-25 03:13:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2203 transitions. [2024-11-25 03:13:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-25 03:13:13,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:13,355 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 03:13:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 1918 states and 2248 transitions. [2024-11-25 03:13:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2248 transitions. [2024-11-25 03:13:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 03:13:14,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:14,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:13:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 1947 states and 2282 transitions. [2024-11-25 03:13:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2282 transitions. [2024-11-25 03:13:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 03:13:16,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:13:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 1961 states and 2299 transitions. [2024-11-25 03:13:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2299 transitions. [2024-11-25 03:13:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 03:13:18,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:18,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:13:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 1964 states and 2302 transitions. [2024-11-25 03:13:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2302 transitions. [2024-11-25 03:13:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 03:13:19,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:13:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 1977 states and 2317 transitions. [2024-11-25 03:13:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2317 transitions. [2024-11-25 03:13:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 03:13:22,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:22,518 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 03:13:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 1980 states and 2320 transitions. [2024-11-25 03:13:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2320 transitions. [2024-11-25 03:13:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 03:13:22,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:23,088 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 03:13:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2021 states and 2368 transitions. [2024-11-25 03:13:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2368 transitions. [2024-11-25 03:13:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-25 03:13:24,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:13:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2060 states and 2420 transitions. [2024-11-25 03:13:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2420 transitions. [2024-11-25 03:13:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 03:13:29,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:29,771 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 03:13:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2074 states and 2435 transitions. [2024-11-25 03:13:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2435 transitions. [2024-11-25 03:13:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 03:13:30,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-25 03:13:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2077 states and 2438 transitions. [2024-11-25 03:13:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2438 transitions. [2024-11-25 03:13:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 03:13:32,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:13:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2089 states and 2454 transitions. [2024-11-25 03:13:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2454 transitions. [2024-11-25 03:13:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 03:13:34,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:13:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2091 states and 2456 transitions. [2024-11-25 03:13:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2456 transitions. [2024-11-25 03:13:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:13:35,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:35,946 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 03:13:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2103 states and 2468 transitions. [2024-11-25 03:13:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2468 transitions. [2024-11-25 03:13:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:13:36,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:36,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:37,667 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 03:13:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2180 states and 2560 transitions. [2024-11-25 03:13:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2560 transitions. [2024-11-25 03:13:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:13:46,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:46,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:46,601 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 03:13:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2182 states and 2561 transitions. [2024-11-25 03:13:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2561 transitions. [2024-11-25 03:13:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:13:47,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:13:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2185 states and 2564 transitions. [2024-11-25 03:13:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2564 transitions. [2024-11-25 03:13:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 03:13:48,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:48,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:48,448 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 03:13:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2194 states and 2573 transitions. [2024-11-25 03:13:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2573 transitions. [2024-11-25 03:13:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 03:13:48,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:49,094 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 03:13:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2218 states and 2599 transitions. [2024-11-25 03:13:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 2599 transitions. [2024-11-25 03:13:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:13:49,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:49,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:50,426 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 03:13:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2266 states and 2662 transitions. [2024-11-25 03:13:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 2662 transitions. [2024-11-25 03:13:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:13:55,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:55,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:55,576 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 03:13:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2270 states and 2666 transitions. [2024-11-25 03:13:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2666 transitions. [2024-11-25 03:13:56,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:13:56,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-25 03:13:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2273 states and 2669 transitions. [2024-11-25 03:13:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2669 transitions. [2024-11-25 03:13:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:13:56,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-25 03:13:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2276 states and 2672 transitions. [2024-11-25 03:13:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2672 transitions. [2024-11-25 03:13:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-25 03:13:57,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:57,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:57,725 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 03:13:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:13:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2279 states and 2675 transitions. [2024-11-25 03:13:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2675 transitions. [2024-11-25 03:13:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:13:57,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:13:57,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:13:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:13:58,312 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 03:14:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2290 states and 2688 transitions. [2024-11-25 03:14:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 2688 transitions. [2024-11-25 03:14:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:14:00,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:01,248 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 03:14:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2347 states and 2752 transitions. [2024-11-25 03:14:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 2752 transitions. [2024-11-25 03:14:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:14:11,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:11,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:11,964 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 03:14:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2394 states and 2800 transitions. [2024-11-25 03:14:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 2800 transitions. [2024-11-25 03:14:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:14:19,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:19,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:19,649 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 03:14:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2409 states and 2815 transitions. [2024-11-25 03:14:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2815 transitions. [2024-11-25 03:14:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:14:21,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 03:14:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2410 states and 2815 transitions. [2024-11-25 03:14:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2815 transitions. [2024-11-25 03:14:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:14:22,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 03:14:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2411 states and 2815 transitions. [2024-11-25 03:14:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2815 transitions. [2024-11-25 03:14:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-25 03:14:23,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:24,300 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 03:14:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2418 states and 2822 transitions. [2024-11-25 03:14:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2822 transitions. [2024-11-25 03:14:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-25 03:14:24,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 253 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:14:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2419 states and 2822 transitions. [2024-11-25 03:14:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2822 transitions. [2024-11-25 03:14:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 03:14:25,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:25,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:25,762 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 03:14:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2450 states and 2855 transitions. [2024-11-25 03:14:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2855 transitions. [2024-11-25 03:14:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:14:30,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:30,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:30,633 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 03:14:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2453 states and 2859 transitions. [2024-11-25 03:14:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 2859 transitions. [2024-11-25 03:14:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:14:30,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:30,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:14:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2464 states and 2877 transitions. [2024-11-25 03:14:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 2877 transitions. [2024-11-25 03:14:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:14:33,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:14:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2465 states and 2880 transitions. [2024-11-25 03:14:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 2880 transitions. [2024-11-25 03:14:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:14:34,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:14:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2466 states and 2881 transitions. [2024-11-25 03:14:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 2881 transitions. [2024-11-25 03:14:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:14:35,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:14:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2467 states and 2882 transitions. [2024-11-25 03:14:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2882 transitions. [2024-11-25 03:14:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:14:36,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 03:14:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 2594 states and 3025 transitions. [2024-11-25 03:14:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3025 transitions. [2024-11-25 03:14:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 03:14:47,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:47,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:14:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 2655 states and 3094 transitions. [2024-11-25 03:14:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3094 transitions. [2024-11-25 03:14:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 03:14:51,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:51,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:14:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 2660 states and 3100 transitions. [2024-11-25 03:14:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3100 transitions. [2024-11-25 03:14:51,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-25 03:14:51,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-25 03:14:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 2661 states and 3100 transitions. [2024-11-25 03:14:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3100 transitions. [2024-11-25 03:14:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 03:14:52,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:14:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:14:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:14:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-25 03:14:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:14:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 2713 states and 3148 transitions. [2024-11-25 03:14:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3148 transitions. [2024-11-25 03:14:56,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 03:14:56,232 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 98 iterations. [2024-11-25 03:14:56,241 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 03:15:36,388 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,389 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,389 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,389 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,390 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,390 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,390 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,391 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,391 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,391 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,391 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,392 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,392 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,392 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,393 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,395 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,395 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,395 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,396 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,396 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,396 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,396 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,396 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,396 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,397 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,397 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,397 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,397 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,397 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,397 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,398 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,398 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,398 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,398 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,398 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,398 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,398 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,399 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,402 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,402 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,402 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,402 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,403 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,403 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,403 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,403 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,403 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 03:15:36,404 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,404 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-25 03:15:36,404 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,404 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,404 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,404 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,405 INFO L77 FloydHoareUtils]: At program point L557-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-25 03:15:36,405 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,406 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,406 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,406 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 03:15:36,406 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,407 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,407 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,407 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,407 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,408 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,408 INFO L77 FloydHoareUtils]: At program point L560-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-25 03:15:36,408 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,408 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,408 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-11-25 03:15:36,408 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 561) no Hoare annotation was computed. [2024-11-25 03:15:36,409 INFO L75 FloydHoareUtils]: For program point L561(line 561) no Hoare annotation was computed. [2024-11-25 03:15:36,409 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,409 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-25 03:15:36,409 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,409 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,410 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,410 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:15:36,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:15:36 ImpRootNode [2024-11-25 03:15:36,440 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:15:36,440 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:15:36,440 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:15:36,441 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:15:36,441 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:11:48" (3/4) ... [2024-11-25 03:15:36,444 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 03:15:36,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-25 03:15:36,473 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-25 03:15:36,473 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-25 03:15:36,474 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 03:15:36,637 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:15:36,638 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:15:36,638 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:15:36,639 INFO L158 Benchmark]: Toolchain (without parser) took 230479.88ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 90.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-25 03:15:36,639 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:15:36,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 684.03ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 64.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 03:15:36,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.18ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 58.3MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:15:36,644 INFO L158 Benchmark]: Boogie Preprocessor took 64.71ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:15:36,644 INFO L158 Benchmark]: RCFGBuilder took 1882.25ms. Allocated memory is still 117.4MB. Free memory was 54.2MB in the beginning and 69.4MB in the end (delta: -15.2MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-11-25 03:15:36,644 INFO L158 Benchmark]: CodeCheck took 227564.55ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 69.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-25 03:15:36,644 INFO L158 Benchmark]: Witness Printer took 197.77ms. Allocated memory is still 2.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:15:36,646 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: 187.3s, OverallIterations: 98, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299810 SdHoareTripleChecker+Valid, 903.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298944 mSDsluCounter, 39721 SdHoareTripleChecker+Invalid, 776.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33714 mSDsCounter, 64565 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 649853 IncrementalHoareTripleChecker+Invalid, 714418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64565 mSolverCounterUnsat, 6007 mSDtfsCounter, 649853 mSolverCounterSat, 7.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133117 GetRequests, 125003 SyntacticMatches, 7168 SemanticMatches, 946 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623059 ImplicationChecksByTransitivity, 128.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 19834 NumberOfCodeBlocks, 19834 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 19737 ConstructedInterpolants, 0 QuantifiedInterpolants, 156350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 24 PerfectInterpolantSequences, 18192/23524 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 - PositiveResult [Line: 561]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 684.03ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 64.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.18ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 58.3MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.71ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1882.25ms. Allocated memory is still 117.4MB. Free memory was 54.2MB in the beginning and 69.4MB in the end (delta: -15.2MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * CodeCheck took 227564.55ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 69.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 197.77ms. Allocated memory is still 2.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 03:15:36,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0904552d-33ab-455c-81da-70eb5844f2f8/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 Result: TRUE