./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm --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 ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:33:25,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:33:25,421 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:33:25,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:33:25,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:33:25,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:33:25,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:33:25,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:33:25,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:33:25,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:33:25,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:33:25,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:33:25,456 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:33:25,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:33:25,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:33:25,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:33:25,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:33:25,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:33:25,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:33:25,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:33:25,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:33:25,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:33:25,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:33:25,458 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:33:25,458 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:33:25,458 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:33:25,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:33:25,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:33:25,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:33:25,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:33:25,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:33:25,459 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:33:25,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:33:25,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm 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 -> ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a [2024-11-13 21:33:25,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:33:25,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:33:25,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:33:25,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:33:25,859 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:33:25,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c Unable to find full path for "g++" [2024-11-13 21:33:28,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:33:28,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:33:28,525 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2024-11-13 21:33:28,554 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/data/f7df1c337/3bf73583e5704069bc23ceaa2908c11c/FLAG56f24cf2d [2024-11-13 21:33:28,588 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/data/f7df1c337/3bf73583e5704069bc23ceaa2908c11c [2024-11-13 21:33:28,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:33:28,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:33:28,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:33:28,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:33:28,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:33:28,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:33:28" (1/1) ... [2024-11-13 21:33:28,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a6e1601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:28, skipping insertion in model container [2024-11-13 21:33:28,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:33:28" (1/1) ... [2024-11-13 21:33:28,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:33:29,095 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_b37cef30-ba8c-4f49-ab3f-b06abbb772df/sv-benchmarks/c/eca-rers2012/Problem01_label00.c[18976,18989] [2024-11-13 21:33:29,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:33:29,157 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:33:29,310 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_b37cef30-ba8c-4f49-ab3f-b06abbb772df/sv-benchmarks/c/eca-rers2012/Problem01_label00.c[18976,18989] [2024-11-13 21:33:29,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:33:29,356 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:33:29,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29 WrapperNode [2024-11-13 21:33:29,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:33:29,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:33:29,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:33:29,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:33:29,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,452 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 21:33:29,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:33:29,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:33:29,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:33:29,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:33:29,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:33:29,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:33:29,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:33:29,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:33:29,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:33:29" (1/1) ... [2024-11-13 21:33:29,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:33:29,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:33:29,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:33:29,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:33:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:33:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:33:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:33:29,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:33:29,740 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:33:29,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:33:31,477 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 21:33:31,477 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:33:31,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:33:31,873 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:33:31,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:33:31 BoogieIcfgContainer [2024-11-13 21:33:31,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:33:31,875 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:33:31,875 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:33:31,887 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:33:31,887 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:33:31" (1/1) ... [2024-11-13 21:33:31,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:33:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 21:33:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 21:33:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 21:33:31,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:33,273 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-13 21:33:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-13 21:33:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-13 21:33:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:33:34,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:34,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:34,570 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-13 21:33:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-13 21:33:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-13 21:33:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:33:35,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-13 21:33:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-13 21:33:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 21:33:37,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:37,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-13 21:33:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-13 21:33:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 21:33:39,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:33:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-13 21:33:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-13 21:33:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 21:33:39,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:39,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:33:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-13 21:33:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-13 21:33:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 21:33:40,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:33:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-13 21:33:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-13 21:33:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 21:33:42,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:42,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:33:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-13 21:33:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-13 21:33:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 21:33:43,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:43,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:33:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-13 21:33:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-13 21:33:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 21:33:44,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:33:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-13 21:33:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-13 21:33:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 21:33:47,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 21:33:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-13 21:33:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-13 21:33:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 21:33:47,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-13 21:33:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-13 21:33:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 21:33:51,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-13 21:33:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-13 21:33:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 21:33:51,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 21:33:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-11-13 21:33:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-11-13 21:33:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 21:33:52,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:33:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-11-13 21:33:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-11-13 21:33:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 21:33:52,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-11-13 21:33:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-11-13 21:33:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 21:33:55,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-11-13 21:33:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-11-13 21:33:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 21:33:57,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-13 21:33:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-13 21:33:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 21:33:58,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:33:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-11-13 21:33:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-11-13 21:33:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 21:33:58,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:34:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-11-13 21:34:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-11-13 21:34:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 21:34:00,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 21:34:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-11-13 21:34:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-11-13 21:34:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 21:34:00,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:34:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 658 states and 796 transitions. [2024-11-13 21:34:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2024-11-13 21:34:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 21:34:01,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:01,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:34:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 705 states and 856 transitions. [2024-11-13 21:34:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 856 transitions. [2024-11-13 21:34:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 21:34:03,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:03,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:34:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 720 states and 876 transitions. [2024-11-13 21:34:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 876 transitions. [2024-11-13 21:34:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 21:34:04,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 804 states and 972 transitions. [2024-11-13 21:34:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 972 transitions. [2024-11-13 21:34:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:34:09,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:09,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 854 states and 1035 transitions. [2024-11-13 21:34:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1035 transitions. [2024-11-13 21:34:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:34:11,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:11,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 856 states and 1038 transitions. [2024-11-13 21:34:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1038 transitions. [2024-11-13 21:34:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 21:34:12,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:34:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 918 states and 1111 transitions. [2024-11-13 21:34:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1111 transitions. [2024-11-13 21:34:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 21:34:14,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:34:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 920 states and 1112 transitions. [2024-11-13 21:34:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1112 transitions. [2024-11-13 21:34:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:34:15,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1013 states and 1225 transitions. [2024-11-13 21:34:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1225 transitions. [2024-11-13 21:34:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:34:19,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1017 states and 1230 transitions. [2024-11-13 21:34:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1230 transitions. [2024-11-13 21:34:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:34:20,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:34:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1052 states and 1271 transitions. [2024-11-13 21:34:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1271 transitions. [2024-11-13 21:34:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 21:34:23,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 21:34:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1067 states and 1290 transitions. [2024-11-13 21:34:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1290 transitions. [2024-11-13 21:34:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 21:34:24,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:34:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1159 states and 1386 transitions. [2024-11-13 21:34:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1386 transitions. [2024-11-13 21:34:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:34:26,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:26,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1205 states and 1440 transitions. [2024-11-13 21:34:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1440 transitions. [2024-11-13 21:34:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:34:28,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:28,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1206 states and 1441 transitions. [2024-11-13 21:34:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1441 transitions. [2024-11-13 21:34:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:34:29,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:29,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 21:34:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1266 states and 1514 transitions. [2024-11-13 21:34:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1514 transitions. [2024-11-13 21:34:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 21:34:31,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:31,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:34:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1304 states and 1557 transitions. [2024-11-13 21:34:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1557 transitions. [2024-11-13 21:34:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:34:33,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:33,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 21:34:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1339 states and 1594 transitions. [2024-11-13 21:34:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1594 transitions. [2024-11-13 21:34:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:34:34,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:34,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:34:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1391 states and 1655 transitions. [2024-11-13 21:34:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1655 transitions. [2024-11-13 21:34:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:34:38,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:34:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1394 states and 1658 transitions. [2024-11-13 21:34:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1658 transitions. [2024-11-13 21:34:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 21:34:39,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1423 states and 1692 transitions. [2024-11-13 21:34:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1692 transitions. [2024-11-13 21:34:42,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 21:34:42,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:42,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1446 states and 1718 transitions. [2024-11-13 21:34:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1718 transitions. [2024-11-13 21:34:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 21:34:44,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:44,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1463 states and 1735 transitions. [2024-11-13 21:34:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1735 transitions. [2024-11-13 21:34:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:34:46,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:34:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1512 states and 1802 transitions. [2024-11-13 21:34:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1802 transitions. [2024-11-13 21:34:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:34:50,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:34:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1522 states and 1811 transitions. [2024-11-13 21:34:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1811 transitions. [2024-11-13 21:34:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:34:51,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:51,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:34:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1537 states and 1825 transitions. [2024-11-13 21:34:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1825 transitions. [2024-11-13 21:34:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:34:53,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 21:34:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1540 states and 1828 transitions. [2024-11-13 21:34:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1828 transitions. [2024-11-13 21:34:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 21:34:54,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:34:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1674 states and 1976 transitions. [2024-11-13 21:34:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1976 transitions. [2024-11-13 21:34:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:34:59,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:59,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:35:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 1699 states and 2002 transitions. [2024-11-13 21:35:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2002 transitions. [2024-11-13 21:35:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:35:01,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:35:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1712 states and 2017 transitions. [2024-11-13 21:35:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2017 transitions. [2024-11-13 21:35:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:35:02,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:02,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:35:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 1715 states and 2021 transitions. [2024-11-13 21:35:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2021 transitions. [2024-11-13 21:35:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 21:35:03,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:03,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 21:35:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 1803 states and 2122 transitions. [2024-11-13 21:35:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2122 transitions. [2024-11-13 21:35:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 21:35:07,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:35:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 1877 states and 2198 transitions. [2024-11-13 21:35:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2198 transitions. [2024-11-13 21:35:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 21:35:09,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:35:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 1898 states and 2220 transitions. [2024-11-13 21:35:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2220 transitions. [2024-11-13 21:35:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 21:35:12,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 21:35:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1900 states and 2222 transitions. [2024-11-13 21:35:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2222 transitions. [2024-11-13 21:35:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:35:13,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:13,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 21:35:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 1915 states and 2239 transitions. [2024-11-13 21:35:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2239 transitions. [2024-11-13 21:35:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 21:35:14,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:14,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 21:35:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1952 states and 2284 transitions. [2024-11-13 21:35:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2284 transitions. [2024-11-13 21:35:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 21:35:16,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:16,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 1963 states and 2296 transitions. [2024-11-13 21:35:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2296 transitions. [2024-11-13 21:35:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 21:35:17,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 1966 states and 2300 transitions. [2024-11-13 21:35:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2300 transitions. [2024-11-13 21:35:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 21:35:18,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 1971 states and 2305 transitions. [2024-11-13 21:35:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2305 transitions. [2024-11-13 21:35:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:35:20,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 21:35:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 1985 states and 2321 transitions. [2024-11-13 21:35:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2321 transitions. [2024-11-13 21:35:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:35:21,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:21,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 21:35:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2026 states and 2369 transitions. [2024-11-13 21:35:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2369 transitions. [2024-11-13 21:35:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 21:35:23,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2065 states and 2423 transitions. [2024-11-13 21:35:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2423 transitions. [2024-11-13 21:35:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:35:27,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:27,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 21:35:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2079 states and 2438 transitions. [2024-11-13 21:35:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2438 transitions. [2024-11-13 21:35:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:35:29,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:29,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-13 21:35:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2082 states and 2441 transitions. [2024-11-13 21:35:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2441 transitions. [2024-11-13 21:35:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 21:35:30,442 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 21:35:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2094 states and 2457 transitions. [2024-11-13 21:35:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2457 transitions. [2024-11-13 21:35:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 21:35:32,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 21:35:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2096 states and 2459 transitions. [2024-11-13 21:35:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2459 transitions. [2024-11-13 21:35:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:35:33,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:33,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 21:35:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2108 states and 2473 transitions. [2024-11-13 21:35:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2473 transitions. [2024-11-13 21:35:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:35:34,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:34,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 21:35:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2109 states and 2473 transitions. [2024-11-13 21:35:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2473 transitions. [2024-11-13 21:35:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:35:34,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:35:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2186 states and 2570 transitions. [2024-11-13 21:35:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2570 transitions. [2024-11-13 21:35:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:35:42,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:35:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2223 states and 2612 transitions. [2024-11-13 21:35:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2612 transitions. [2024-11-13 21:35:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:35:46,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:35:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2224 states and 2612 transitions. [2024-11-13 21:35:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 2612 transitions. [2024-11-13 21:35:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:35:47,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:35:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2227 states and 2616 transitions. [2024-11-13 21:35:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2616 transitions. [2024-11-13 21:35:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:35:48,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:35:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2236 states and 2625 transitions. [2024-11-13 21:35:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2625 transitions. [2024-11-13 21:35:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:35:49,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:49,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-13 21:35:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2260 states and 2651 transitions. [2024-11-13 21:35:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2651 transitions. [2024-11-13 21:35:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:35:50,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:50,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:35:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2337 states and 2746 transitions. [2024-11-13 21:35:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2746 transitions. [2024-11-13 21:35:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:35:57,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:57,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:35:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2341 states and 2750 transitions. [2024-11-13 21:35:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2750 transitions. [2024-11-13 21:35:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:35:58,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:58,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:36:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2356 states and 2772 transitions. [2024-11-13 21:36:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2772 transitions. [2024-11-13 21:36:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:36:02,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:36:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2358 states and 2774 transitions. [2024-11-13 21:36:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2774 transitions. [2024-11-13 21:36:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:36:03,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:36:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2363 states and 2783 transitions. [2024-11-13 21:36:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 2783 transitions. [2024-11-13 21:36:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 21:36:05,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 21:36:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2366 states and 2789 transitions. [2024-11-13 21:36:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2789 transitions. [2024-11-13 21:36:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:06,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:06,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:36:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2377 states and 2802 transitions. [2024-11-13 21:36:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 2802 transitions. [2024-11-13 21:36:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:09,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:09,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:36:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2437 states and 2867 transitions. [2024-11-13 21:36:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2867 transitions. [2024-11-13 21:36:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:17,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:17,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:36:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2470 states and 2905 transitions. [2024-11-13 21:36:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2905 transitions. [2024-11-13 21:36:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:22,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:22,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:36:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2486 states and 2920 transitions. [2024-11-13 21:36:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2920 transitions. [2024-11-13 21:36:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:25,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:25,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:36:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2500 states and 2933 transitions. [2024-11-13 21:36:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 2933 transitions. [2024-11-13 21:36:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:28,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 21:36:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2503 states and 2940 transitions. [2024-11-13 21:36:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2940 transitions. [2024-11-13 21:36:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:30,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 21:36:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2504 states and 2940 transitions. [2024-11-13 21:36:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 2940 transitions. [2024-11-13 21:36:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:31,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:31,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 21:36:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2505 states and 2943 transitions. [2024-11-13 21:36:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 2943 transitions. [2024-11-13 21:36:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 21:36:31,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:31,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:36:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2512 states and 2950 transitions. [2024-11-13 21:36:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 2950 transitions. [2024-11-13 21:36:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-13 21:36:32,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:36:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2535 states and 2981 transitions. [2024-11-13 21:36:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 2981 transitions. [2024-11-13 21:36:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 21:36:36,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:36,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:36:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 2566 states and 3014 transitions. [2024-11-13 21:36:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3014 transitions. [2024-11-13 21:36:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:36:41,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:36:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 2569 states and 3018 transitions. [2024-11-13 21:36:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3018 transitions. [2024-11-13 21:36:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:36:41,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:41,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:36:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 2580 states and 3034 transitions. [2024-11-13 21:36:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3034 transitions. [2024-11-13 21:36:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:36:44,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:36:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 2592 states and 3049 transitions. [2024-11-13 21:36:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3049 transitions. [2024-11-13 21:36:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:36:47,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 21:36:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 2700 states and 3173 transitions. [2024-11-13 21:36:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3173 transitions. [2024-11-13 21:36:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 21:36:55,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:37:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:37:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 2761 states and 3242 transitions. [2024-11-13 21:37:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3242 transitions. [2024-11-13 21:37:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 21:37:00,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:37:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:37:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:37:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:37:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:37:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 2766 states and 3248 transitions. [2024-11-13 21:37:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3248 transitions. [2024-11-13 21:37:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 21:37:01,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:37:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:37:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:37:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-13 21:37:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:37:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 2767 states and 3248 transitions. [2024-11-13 21:37:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2767 states and 3248 transitions. [2024-11-13 21:37:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 21:37:01,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:37:01,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:37:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:37:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 21:37:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:37:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 2819 states and 3296 transitions. [2024-11-13 21:37:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3296 transitions. [2024-11-13 21:37:06,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:37:06,047 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 102 iterations. [2024-11-13 21:37:06,060 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 21:37:53,990 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 21:37:53,991 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,992 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,992 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,992 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:53,993 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:53,993 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 21:37:53,993 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,994 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-13 21:37:53,994 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,994 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 21:37:53,995 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,995 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,995 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:53,996 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 21:37:53,996 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,996 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,996 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:53,997 INFO L77 FloydHoareUtils]: At program point L506-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-13 21:37:53,997 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,997 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,997 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,997 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,998 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,998 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 21:37:53,998 INFO L77 FloydHoareUtils]: At program point L509-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-13 21:37:53,998 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:53,999 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-13 21:37:53,999 INFO L75 FloydHoareUtils]: For program point L510(line 510) no Hoare annotation was computed. [2024-11-13 21:37:54,000 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:54,001 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 21:37:54,001 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,003 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,003 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:54,004 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-13 21:37:54,004 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,005 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,006 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,006 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 21:37:54,006 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:54,006 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,007 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-13 21:37:54,007 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:54,007 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,007 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,008 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,008 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 21:37:54,008 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,008 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,009 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:37:54,009 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 21:37:54,009 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 21:37:54,009 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,009 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:54,010 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,010 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 21:37:54,010 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,010 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,010 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,011 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:37:54,011 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,011 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:54,011 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 21:37:54,011 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,012 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:54,012 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 21:37:54,012 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,012 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,012 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-11-13 21:37:54,013 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 510) no Hoare annotation was computed. [2024-11-13 21:37:54,013 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,013 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 21:37:54,013 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,013 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,014 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 21:37:54,014 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 21:37:54,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:37:54 ImpRootNode [2024-11-13 21:37:54,033 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:37:54,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:37:54,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:37:54,034 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:37:54,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:33:31" (3/4) ... [2024-11-13 21:37:54,038 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:37:54,055 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-13 21:37:54,056 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 21:37:54,057 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 21:37:54,058 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:37:54,223 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:37:54,224 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:37:54,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:37:54,226 INFO L158 Benchmark]: Toolchain (without parser) took 265633.62ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 117.6MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 712.3MB. Max. memory is 16.1GB. [2024-11-13 21:37:54,227 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 167.8MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:37:54,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.36ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 90.3MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:37:54,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.37ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 84.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:37:54,228 INFO L158 Benchmark]: Boogie Preprocessor took 107.52ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 80.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:37:54,228 INFO L158 Benchmark]: RCFGBuilder took 2312.71ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 73.0MB in the end (delta: 7.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-13 21:37:54,228 INFO L158 Benchmark]: CodeCheck took 262158.55ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 73.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 651.8MB. Max. memory is 16.1GB. [2024-11-13 21:37:54,231 INFO L158 Benchmark]: Witness Printer took 191.37ms. Allocated memory is still 2.5GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:37:54,233 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 214.1s, OverallIterations: 102, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322189 SdHoareTripleChecker+Valid, 1145.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321287 mSDsluCounter, 43112 SdHoareTripleChecker+Invalid, 987.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36607 mSDsCounter, 67752 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695974 IncrementalHoareTripleChecker+Invalid, 763726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67752 mSolverCounterUnsat, 6505 mSDtfsCounter, 695974 mSolverCounterSat, 10.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139304 GetRequests, 130817 SyntacticMatches, 7491 SemanticMatches, 996 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706165 ImplicationChecksByTransitivity, 146.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 37.4s InterpolantComputationTime, 20716 NumberOfCodeBlocks, 20716 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 20615 ConstructedInterpolants, 0 QuantifiedInterpolants, 166540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 23 PerfectInterpolantSequences, 18943/24486 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: 510]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 167.8MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 761.36ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 90.3MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.37ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 84.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.52ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 80.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2312.71ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 73.0MB in the end (delta: 7.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * CodeCheck took 262158.55ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 73.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 651.8MB. Max. memory is 16.1GB. * Witness Printer took 191.37ms. Allocated memory is still 2.5GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 21:37:54,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b37cef30-ba8c-4f49-ab3f-b06abbb772df/bin/ukojak-verify-EEHR8qb7sm/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