./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label35.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3e3930727d0c60d79f1b553922b6ffa9dda0949b70cfe091b5b493dd5b1378e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:04:25,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:04:25,259 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:04:25,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:04:25,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:04:25,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:04:25,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:04:25,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:04:25,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:04:25,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:04:25,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:04:25,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:04:25,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:04:25,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:04:25,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:04:25,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:04:25,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:04:25,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:04:25,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:04:25,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:04:25,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:04:25,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:04:25,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:04:25,323 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:04:25,324 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:04:25,324 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:04:25,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:04:25,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:04:25,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:04:25,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:04:25,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:04:25,326 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:04:25,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:04:25,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3e3930727d0c60d79f1b553922b6ffa9dda0949b70cfe091b5b493dd5b1378e [2024-11-08 23:04:25,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:04:25,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:04:25,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:04:25,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:04:25,634 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:04:25,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem02_label35.c Unable to find full path for "g++" [2024-11-08 23:04:27,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:04:27,930 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:04:27,930 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/sv-benchmarks/c/eca-rers2012/Problem02_label35.c [2024-11-08 23:04:27,947 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/data/44169071a/defa946562ba441880799fd2e9d55012/FLAG3175d1351 [2024-11-08 23:04:27,967 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/data/44169071a/defa946562ba441880799fd2e9d55012 [2024-11-08 23:04:27,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:04:27,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:04:27,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:04:27,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:04:27,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:04:27,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:04:27" (1/1) ... [2024-11-08 23:04:27,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6994a580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:27, skipping insertion in model container [2024-11-08 23:04:27,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:04:27" (1/1) ... [2024-11-08 23:04:28,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:04:28,398 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_11bfd357-68ce-4305-808e-5b5c9dcfc053/sv-benchmarks/c/eca-rers2012/Problem02_label35.c[16104,16117] [2024-11-08 23:04:28,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:04:28,494 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:04:28,612 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_11bfd357-68ce-4305-808e-5b5c9dcfc053/sv-benchmarks/c/eca-rers2012/Problem02_label35.c[16104,16117] [2024-11-08 23:04:28,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:04:28,650 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:04:28,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28 WrapperNode [2024-11-08 23:04:28,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:04:28,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:04:28,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:04:28,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:04:28,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,732 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-08 23:04:28,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:04:28,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:04:28,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:04:28,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:04:28,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:04:28,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:04:28,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:04:28,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:04:28,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:28" (1/1) ... [2024-11-08 23:04:28,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:04:28,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:04:28,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:04:28,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:04:28,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:04:28,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:04:28,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:04:28,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:04:29,008 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:04:29,012 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:04:30,308 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 23:04:30,309 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:04:30,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:04:30,640 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:04:30,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:04:30 BoogieIcfgContainer [2024-11-08 23:04:30,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:04:30,642 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:04:30,642 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:04:30,652 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:04:30,653 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:04:30" (1/1) ... [2024-11-08 23:04:30,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:04:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-08 23:04:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-08 23:04:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 23:04:30,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:30,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:31,237 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-08 23:04:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2024-11-08 23:04:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-11-08 23:04:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 23:04:31,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:32,445 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-08 23:04:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2024-11-08 23:04:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-11-08 23:04:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 23:04:32,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 23:04:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 167 states and 248 transitions. [2024-11-08 23:04:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2024-11-08 23:04:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:04:32,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:32,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 181 states and 269 transitions. [2024-11-08 23:04:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 269 transitions. [2024-11-08 23:04:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:04:33,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 199 states and 291 transitions. [2024-11-08 23:04:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2024-11-08 23:04:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 23:04:33,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 221 states and 321 transitions. [2024-11-08 23:04:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 321 transitions. [2024-11-08 23:04:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 23:04:35,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 23:04:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 231 states and 331 transitions. [2024-11-08 23:04:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 331 transitions. [2024-11-08 23:04:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 23:04:35,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 251 states and 355 transitions. [2024-11-08 23:04:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 355 transitions. [2024-11-08 23:04:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 23:04:36,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 355 states and 475 transitions. [2024-11-08 23:04:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 475 transitions. [2024-11-08 23:04:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 23:04:38,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:04:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 356 states and 477 transitions. [2024-11-08 23:04:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 477 transitions. [2024-11-08 23:04:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 23:04:39,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:04:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 359 states and 481 transitions. [2024-11-08 23:04:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 481 transitions. [2024-11-08 23:04:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 23:04:39,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:04:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 363 states and 485 transitions. [2024-11-08 23:04:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 485 transitions. [2024-11-08 23:04:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 23:04:40,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:04:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 373 states and 494 transitions. [2024-11-08 23:04:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 494 transitions. [2024-11-08 23:04:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:04:40,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 379 states and 502 transitions. [2024-11-08 23:04:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 502 transitions. [2024-11-08 23:04:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:04:41,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:41,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 393 states and 516 transitions. [2024-11-08 23:04:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 516 transitions. [2024-11-08 23:04:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:04:42,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:42,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 413 states and 543 transitions. [2024-11-08 23:04:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 543 transitions. [2024-11-08 23:04:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 23:04:43,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 427 states and 563 transitions. [2024-11-08 23:04:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 563 transitions. [2024-11-08 23:04:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:04:44,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:44,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 451 states and 600 transitions. [2024-11-08 23:04:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 600 transitions. [2024-11-08 23:04:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:04:46,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 455 states and 607 transitions. [2024-11-08 23:04:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 607 transitions. [2024-11-08 23:04:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:04:47,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 469 states and 623 transitions. [2024-11-08 23:04:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 623 transitions. [2024-11-08 23:04:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:04:47,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 490 states and 653 transitions. [2024-11-08 23:04:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 653 transitions. [2024-11-08 23:04:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:04:49,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 500 states and 662 transitions. [2024-11-08 23:04:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 662 transitions. [2024-11-08 23:04:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:04:49,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:49,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 506 states and 671 transitions. [2024-11-08 23:04:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 671 transitions. [2024-11-08 23:04:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:04:50,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 524 states and 697 transitions. [2024-11-08 23:04:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 697 transitions. [2024-11-08 23:04:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:04:51,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 544 states and 722 transitions. [2024-11-08 23:04:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 722 transitions. [2024-11-08 23:04:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:04:53,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 549 states and 727 transitions. [2024-11-08 23:04:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 727 transitions. [2024-11-08 23:04:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:04:53,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:53,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 555 states and 734 transitions. [2024-11-08 23:04:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 734 transitions. [2024-11-08 23:04:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:04:54,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:54,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 573 states and 753 transitions. [2024-11-08 23:04:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 753 transitions. [2024-11-08 23:04:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:04:55,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 582 states and 762 transitions. [2024-11-08 23:04:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 762 transitions. [2024-11-08 23:04:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:04:56,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:04:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 616 states and 804 transitions. [2024-11-08 23:04:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 804 transitions. [2024-11-08 23:04:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:04:59,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 626 states and 816 transitions. [2024-11-08 23:05:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 816 transitions. [2024-11-08 23:05:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:05:00,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 631 states and 822 transitions. [2024-11-08 23:05:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 822 transitions. [2024-11-08 23:05:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:05:01,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 637 states and 828 transitions. [2024-11-08 23:05:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 828 transitions. [2024-11-08 23:05:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:05:01,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 643 states and 834 transitions. [2024-11-08 23:05:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 834 transitions. [2024-11-08 23:05:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 23:05:02,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 676 states and 874 transitions. [2024-11-08 23:05:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 874 transitions. [2024-11-08 23:05:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:05:03,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 23:05:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 689 states and 891 transitions. [2024-11-08 23:05:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 891 transitions. [2024-11-08 23:05:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:05:04,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:04,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 23:05:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 694 states and 895 transitions. [2024-11-08 23:05:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 895 transitions. [2024-11-08 23:05:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:05:05,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 23:05:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 699 states and 901 transitions. [2024-11-08 23:05:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 901 transitions. [2024-11-08 23:05:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:05:05,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 23:05:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 704 states and 905 transitions. [2024-11-08 23:05:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 905 transitions. [2024-11-08 23:05:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 23:05:05,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:05,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 23:05:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 715 states and 921 transitions. [2024-11-08 23:05:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 921 transitions. [2024-11-08 23:05:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 23:05:06,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:06,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 23:05:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 716 states and 922 transitions. [2024-11-08 23:05:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 922 transitions. [2024-11-08 23:05:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:05:06,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:06,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:05:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 729 states and 938 transitions. [2024-11-08 23:05:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 938 transitions. [2024-11-08 23:05:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:05:07,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:07,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:05:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 739 states and 949 transitions. [2024-11-08 23:05:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 949 transitions. [2024-11-08 23:05:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:05:08,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:08,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:05:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 744 states and 953 transitions. [2024-11-08 23:05:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 953 transitions. [2024-11-08 23:05:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:05:09,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:05:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 749 states and 957 transitions. [2024-11-08 23:05:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 957 transitions. [2024-11-08 23:05:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:05:09,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 758 states and 966 transitions. [2024-11-08 23:05:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 966 transitions. [2024-11-08 23:05:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:05:09,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:09,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 784 states and 1001 transitions. [2024-11-08 23:05:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1001 transitions. [2024-11-08 23:05:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:05:12,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 795 states and 1012 transitions. [2024-11-08 23:05:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1012 transitions. [2024-11-08 23:05:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 23:05:13,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:13,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:05:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 802 states and 1030 transitions. [2024-11-08 23:05:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1030 transitions. [2024-11-08 23:05:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 23:05:14,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:14,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:05:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 825 states and 1056 transitions. [2024-11-08 23:05:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1056 transitions. [2024-11-08 23:05:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 23:05:16,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:05:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 841 states and 1072 transitions. [2024-11-08 23:05:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1072 transitions. [2024-11-08 23:05:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 23:05:17,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:17,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 23:05:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 868 states and 1109 transitions. [2024-11-08 23:05:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1109 transitions. [2024-11-08 23:05:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 23:05:20,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:20,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 23:05:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 883 states and 1126 transitions. [2024-11-08 23:05:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1126 transitions. [2024-11-08 23:05:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 23:05:21,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 23:05:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 891 states and 1135 transitions. [2024-11-08 23:05:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1135 transitions. [2024-11-08 23:05:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 23:05:22,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:05:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 914 states and 1166 transitions. [2024-11-08 23:05:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1166 transitions. [2024-11-08 23:05:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 23:05:24,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:05:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 931 states and 1186 transitions. [2024-11-08 23:05:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1186 transitions. [2024-11-08 23:05:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 23:05:26,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 23:05:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 932 states and 1187 transitions. [2024-11-08 23:05:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1187 transitions. [2024-11-08 23:05:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 23:05:26,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:05:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 937 states and 1192 transitions. [2024-11-08 23:05:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1192 transitions. [2024-11-08 23:05:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 23:05:26,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:26,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 975 states and 1252 transitions. [2024-11-08 23:05:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1252 transitions. [2024-11-08 23:05:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:05:27,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 23:05:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 978 states and 1255 transitions. [2024-11-08 23:05:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1255 transitions. [2024-11-08 23:05:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:05:28,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1045 states and 1329 transitions. [2024-11-08 23:05:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1329 transitions. [2024-11-08 23:05:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 23:05:33,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 23:05:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1046 states and 1331 transitions. [2024-11-08 23:05:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1331 transitions. [2024-11-08 23:05:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 23:05:33,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:33,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1070 states and 1367 transitions. [2024-11-08 23:05:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1367 transitions. [2024-11-08 23:05:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 23:05:36,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1071 states and 1367 transitions. [2024-11-08 23:05:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1367 transitions. [2024-11-08 23:05:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 23:05:37,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1085 states and 1381 transitions. [2024-11-08 23:05:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1381 transitions. [2024-11-08 23:05:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:05:38,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:38,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1123 states and 1427 transitions. [2024-11-08 23:05:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1427 transitions. [2024-11-08 23:05:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:05:41,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1126 states and 1430 transitions. [2024-11-08 23:05:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1430 transitions. [2024-11-08 23:05:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:05:42,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1171 states and 1484 transitions. [2024-11-08 23:05:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1484 transitions. [2024-11-08 23:05:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:05:46,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1220 states and 1534 transitions. [2024-11-08 23:05:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1534 transitions. [2024-11-08 23:05:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:05:51,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:51,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1225 states and 1539 transitions. [2024-11-08 23:05:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1539 transitions. [2024-11-08 23:05:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:05:52,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:52,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1245 states and 1564 transitions. [2024-11-08 23:05:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1564 transitions. [2024-11-08 23:05:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:05:54,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:54,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 23:05:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1261 states and 1586 transitions. [2024-11-08 23:05:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1586 transitions. [2024-11-08 23:05:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:05:56,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 23:05:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1263 states and 1589 transitions. [2024-11-08 23:05:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1589 transitions. [2024-11-08 23:05:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:05:57,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 23:05:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1268 states and 1594 transitions. [2024-11-08 23:05:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1594 transitions. [2024-11-08 23:05:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:05:58,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 23:05:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1274 states and 1600 transitions. [2024-11-08 23:05:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1600 transitions. [2024-11-08 23:05:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:05:59,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:05:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1277 states and 1602 transitions. [2024-11-08 23:05:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1602 transitions. [2024-11-08 23:05:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:05:59,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:06:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1287 states and 1616 transitions. [2024-11-08 23:06:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1616 transitions. [2024-11-08 23:06:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:06:02,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:06:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1291 states and 1620 transitions. [2024-11-08 23:06:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1620 transitions. [2024-11-08 23:06:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:06:02,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:06:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1301 states and 1629 transitions. [2024-11-08 23:06:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1629 transitions. [2024-11-08 23:06:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:06:03,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:06:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1337 states and 1672 transitions. [2024-11-08 23:06:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1672 transitions. [2024-11-08 23:06:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:06:07,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:06:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1368 states and 1704 transitions. [2024-11-08 23:06:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1704 transitions. [2024-11-08 23:06:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 23:06:10,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:10,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:06:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1399 states and 1740 transitions. [2024-11-08 23:06:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1740 transitions. [2024-11-08 23:06:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 23:06:14,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:06:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1424 states and 1766 transitions. [2024-11-08 23:06:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1766 transitions. [2024-11-08 23:06:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 23:06:16,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 23:06:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1425 states and 1766 transitions. [2024-11-08 23:06:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1766 transitions. [2024-11-08 23:06:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 23:06:16,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:16,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:06:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1438 states and 1781 transitions. [2024-11-08 23:06:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1781 transitions. [2024-11-08 23:06:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 23:06:17,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:17,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:06:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1443 states and 1785 transitions. [2024-11-08 23:06:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1785 transitions. [2024-11-08 23:06:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:06:18,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-08 23:06:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1554 states and 1910 transitions. [2024-11-08 23:06:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1910 transitions. [2024-11-08 23:06:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:06:24,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:24,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 23:06:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1564 states and 1922 transitions. [2024-11-08 23:06:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1922 transitions. [2024-11-08 23:06:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:06:25,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 23:06:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1569 states and 1926 transitions. [2024-11-08 23:06:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1926 transitions. [2024-11-08 23:06:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 23:06:25,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:06:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1697 states and 2079 transitions. [2024-11-08 23:06:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2079 transitions. [2024-11-08 23:06:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 23:06:33,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 23:06:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1702 states and 2083 transitions. [2024-11-08 23:06:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2083 transitions. [2024-11-08 23:06:33,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 23:06:33,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:33,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 23:06:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 1715 states and 2099 transitions. [2024-11-08 23:06:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2099 transitions. [2024-11-08 23:06:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 23:06:35,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:35,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 23:06:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 1720 states and 2103 transitions. [2024-11-08 23:06:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2103 transitions. [2024-11-08 23:06:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 23:06:35,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:35,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 23:06:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 1730 states and 2112 transitions. [2024-11-08 23:06:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2112 transitions. [2024-11-08 23:06:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 23:06:36,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:36,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 23:06:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1759 states and 2150 transitions. [2024-11-08 23:06:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2150 transitions. [2024-11-08 23:06:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 23:06:40,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 23:06:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1776 states and 2166 transitions. [2024-11-08 23:06:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2166 transitions. [2024-11-08 23:06:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 23:06:42,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 23:06:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 1797 states and 2190 transitions. [2024-11-08 23:06:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2190 transitions. [2024-11-08 23:06:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 23:06:45,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 23:06:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 1818 states and 2215 transitions. [2024-11-08 23:06:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2215 transitions. [2024-11-08 23:06:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 23:06:48,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 23:06:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 1820 states and 2217 transitions. [2024-11-08 23:06:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2217 transitions. [2024-11-08 23:06:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 23:06:48,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 23:06:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 1822 states and 2219 transitions. [2024-11-08 23:06:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2219 transitions. [2024-11-08 23:06:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 23:06:48,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 23:06:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1853 states and 2256 transitions. [2024-11-08 23:06:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2256 transitions. [2024-11-08 23:06:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 23:06:51,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:51,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 23:06:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1880 states and 2287 transitions. [2024-11-08 23:06:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2287 transitions. [2024-11-08 23:06:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 23:06:53,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 23:06:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 1889 states and 2297 transitions. [2024-11-08 23:06:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2297 transitions. [2024-11-08 23:06:54,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 23:06:54,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 23:06:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 1903 states and 2313 transitions. [2024-11-08 23:06:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2313 transitions. [2024-11-08 23:06:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 23:06:56,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 23:06:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 1908 states and 2317 transitions. [2024-11-08 23:06:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2317 transitions. [2024-11-08 23:06:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 23:06:56,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:56,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 23:06:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 1932 states and 2346 transitions. [2024-11-08 23:06:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2346 transitions. [2024-11-08 23:06:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 23:06:58,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 23:06:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 1937 states and 2350 transitions. [2024-11-08 23:06:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2350 transitions. [2024-11-08 23:06:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 23:06:59,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 23:07:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 1938 states and 2351 transitions. [2024-11-08 23:07:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2351 transitions. [2024-11-08 23:07:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 23:07:00,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 23:07:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 1941 states and 2355 transitions. [2024-11-08 23:07:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2355 transitions. [2024-11-08 23:07:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 23:07:02,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 23:07:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 1955 states and 2368 transitions. [2024-11-08 23:07:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2368 transitions. [2024-11-08 23:07:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 23:07:04,020 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 23:07:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 1967 states and 2384 transitions. [2024-11-08 23:07:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2384 transitions. [2024-11-08 23:07:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 23:07:06,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 23:07:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 1973 states and 2389 transitions. [2024-11-08 23:07:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2389 transitions. [2024-11-08 23:07:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 23:07:07,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 23:07:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 1980 states and 2396 transitions. [2024-11-08 23:07:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2396 transitions. [2024-11-08 23:07:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 23:07:08,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 23:07:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 1986 states and 2401 transitions. [2024-11-08 23:07:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2401 transitions. [2024-11-08 23:07:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 23:07:09,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 23:07:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 1992 states and 2407 transitions. [2024-11-08 23:07:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2407 transitions. [2024-11-08 23:07:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 23:07:09,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:09,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 23:07:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 1994 states and 2408 transitions. [2024-11-08 23:07:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2408 transitions. [2024-11-08 23:07:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 23:07:10,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 23:07:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2000 states and 2417 transitions. [2024-11-08 23:07:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2417 transitions. [2024-11-08 23:07:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 23:07:12,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 23:07:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2007 states and 2424 transitions. [2024-11-08 23:07:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2424 transitions. [2024-11-08 23:07:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 23:07:14,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 23:07:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2014 states and 2431 transitions. [2024-11-08 23:07:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2431 transitions. [2024-11-08 23:07:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 23:07:15,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:15,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 23:07:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2020 states and 2436 transitions. [2024-11-08 23:07:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2436 transitions. [2024-11-08 23:07:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 23:07:16,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 23:07:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2026 states and 2441 transitions. [2024-11-08 23:07:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2441 transitions. [2024-11-08 23:07:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 23:07:16,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 23:07:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2028 states and 2442 transitions. [2024-11-08 23:07:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2442 transitions. [2024-11-08 23:07:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 23:07:17,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 23:07:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1665 states and 1990 transitions. [2024-11-08 23:07:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1990 transitions. [2024-11-08 23:07:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 23:07:18,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:07:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 31 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:07:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:07:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 1774 states and 2118 transitions. [2024-11-08 23:07:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2118 transitions. [2024-11-08 23:07:27,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:07:27,548 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 125 iterations. [2024-11-08 23:07:27,564 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-08 23:07:44,068 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,069 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,069 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,069 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,070 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,070 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,070 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,070 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,071 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,071 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,071 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,071 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,072 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,072 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,072 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,073 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,073 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,073 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,073 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,074 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,074 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,074 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,074 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,074 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,075 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,075 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,075 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:07:44,075 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,076 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,076 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,076 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,076 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,076 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,077 INFO L77 FloydHoareUtils]: At program point L460-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (or (and (not (= 7 ~a17~0)) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse0)) (and (<= ~a17~0 8) .cse0))) [2024-11-08 23:07:44,077 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,077 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,077 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,078 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 464) no Hoare annotation was computed. [2024-11-08 23:07:44,078 INFO L77 FloydHoareUtils]: At program point L463-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (or (and (not (= 7 ~a17~0)) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse0)) (and (<= ~a17~0 8) .cse0))) [2024-11-08 23:07:44,078 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,078 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,078 INFO L75 FloydHoareUtils]: For program point L464(line 464) no Hoare annotation was computed. [2024-11-08 23:07:44,079 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,079 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,079 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,079 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,080 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-08 23:07:44,080 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,080 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,080 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,081 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,081 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,081 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-08 23:07:44,081 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,082 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,082 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,082 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,082 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-08 23:07:44,082 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-08 23:07:44,083 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,083 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,083 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,083 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,084 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,084 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,084 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,084 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,085 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,085 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,085 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-08 23:07:44,085 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,086 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,086 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,086 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,086 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-08 23:07:44,086 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,087 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,087 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:07:44,087 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,087 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,087 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,088 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,088 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,088 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,088 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-08 23:07:44,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:07:44 ImpRootNode [2024-11-08 23:07:44,107 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:07:44,108 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:07:44,108 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:07:44,108 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:07:44,109 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:04:30" (3/4) ... [2024-11-08 23:07:44,112 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:07:44,136 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-08 23:07:44,137 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 23:07:44,143 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-08 23:07:44,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:07:44,332 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:07:44,333 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:07:44,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:07:44,336 INFO L158 Benchmark]: Toolchain (without parser) took 196364.56ms. Allocated memory was 151.0MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 119.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 583.3MB. Max. memory is 16.1GB. [2024-11-08 23:07:44,337 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 115.3MB. Free memory was 89.4MB in the beginning and 89.3MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:07:44,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.73ms. Allocated memory is still 151.0MB. Free memory was 118.9MB in the beginning and 90.4MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 23:07:44,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.57ms. Allocated memory is still 151.0MB. Free memory was 90.4MB in the beginning and 84.8MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:07:44,338 INFO L158 Benchmark]: Boogie Preprocessor took 96.19ms. Allocated memory is still 151.0MB. Free memory was 84.8MB in the beginning and 80.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:07:44,338 INFO L158 Benchmark]: RCFGBuilder took 1810.76ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 103.8MB in the end (delta: -23.4MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2024-11-08 23:07:44,339 INFO L158 Benchmark]: CodeCheck took 193465.71ms. Allocated memory was 151.0MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 103.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 554.2MB. Max. memory is 16.1GB. [2024-11-08 23:07:44,339 INFO L158 Benchmark]: Witness Printer took 227.28ms. Allocated memory is still 3.0GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:07:44,341 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 176.9s, OverallIterations: 125, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298906 SdHoareTripleChecker+Valid, 785.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288324 mSDsluCounter, 32041 SdHoareTripleChecker+Invalid, 669.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27109 mSDsCounter, 70917 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 635201 IncrementalHoareTripleChecker+Invalid, 706118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70917 mSolverCounterUnsat, 4932 mSDtfsCounter, 635201 mSolverCounterSat, 7.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133614 GetRequests, 126938 SyntacticMatches, 5492 SemanticMatches, 1184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813385 ImplicationChecksByTransitivity, 137.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 19425 NumberOfCodeBlocks, 19425 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 19301 ConstructedInterpolants, 0 QuantifiedInterpolants, 48817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 124 InterpolantComputations, 106 PerfectInterpolantSequences, 12799/13284 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 - PositiveResult [Line: 464]: 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: 39]: Location Invariant Derived location invariant: ((((((7 != a17) && (a17 < 8)) || ((8 <= a17) && (a19 != 1))) || ((a17 <= 8) && (a19 == 1))) || (((((a25 == 1) && (a11 == 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || (((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17)) && (a25 != 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((7 != a17) && (a17 < 8)) || ((8 <= a17) && (a19 != 1))) || ((a17 <= 8) && (a19 == 1))) || (((((a25 == 1) && (a11 == 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || (((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17)) && (a25 != 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 115.3MB. Free memory was 89.4MB in the beginning and 89.3MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.73ms. Allocated memory is still 151.0MB. Free memory was 118.9MB in the beginning and 90.4MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.57ms. Allocated memory is still 151.0MB. Free memory was 90.4MB in the beginning and 84.8MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.19ms. Allocated memory is still 151.0MB. Free memory was 84.8MB in the beginning and 80.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1810.76ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 103.8MB in the end (delta: -23.4MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * CodeCheck took 193465.71ms. Allocated memory was 151.0MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 103.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 554.2MB. Max. memory is 16.1GB. * Witness Printer took 227.28ms. Allocated memory is still 3.0GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-08 23:07:44,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd357-68ce-4305-808e-5b5c9dcfc053/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE