./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c6f057d93c74db928b7d0b0915eda2af89e3a19cf93af1e21b1cfa684bd6cf4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 01:58:13,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 01:58:14,038 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-25 01:58:14,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 01:58:14,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 01:58:14,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 01:58:14,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 01:58:14,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 01:58:14,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 01:58:14,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 01:58:14,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 01:58:14,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 01:58:14,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 01:58:14,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 01:58:14,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 01:58:14,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 01:58:14,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 01:58:14,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 01:58:14,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 01:58:14,075 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-25 01:58:14,075 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-25 01:58:14,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 01:58:14,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 01:58:14,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 01:58:14,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 01:58:14,076 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 01:58:14,076 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 01:58:14,076 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 01:58:14,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 01:58:14,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 01:58:14,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 01:58:14,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 01:58:14,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 01:58:14,077 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 01:58:14,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 01:58:14,078 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_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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 -> 9c6f057d93c74db928b7d0b0915eda2af89e3a19cf93af1e21b1cfa684bd6cf4 [2024-11-25 01:58:14,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 01:58:14,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 01:58:14,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 01:58:14,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 01:58:14,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 01:58:14,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound1.c [2024-11-25 01:58:17,851 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/data/f4af2415c/d814a08cd4f34dd2b03ad50e2d48beaa/FLAG68beeeb56 [2024-11-25 01:58:18,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 01:58:18,115 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound1.c [2024-11-25 01:58:18,122 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/data/f4af2415c/d814a08cd4f34dd2b03ad50e2d48beaa/FLAG68beeeb56 [2024-11-25 01:58:18,470 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/data/f4af2415c/d814a08cd4f34dd2b03ad50e2d48beaa [2024-11-25 01:58:18,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 01:58:18,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 01:58:18,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 01:58:18,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 01:58:18,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 01:58:18,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27916d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18, skipping insertion in model container [2024-11-25 01:58:18,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 01:58:18,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 01:58:18,758 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 01:58:18,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 01:58:18,803 INFO L204 MainTranslator]: Completed translation [2024-11-25 01:58:18,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18 WrapperNode [2024-11-25 01:58:18,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 01:58:18,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 01:58:18,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 01:58:18,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 01:58:18,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,851 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103 [2024-11-25 01:58:18,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 01:58:18,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 01:58:18,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 01:58:18,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 01:58:18,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 01:58:18,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 01:58:18,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 01:58:18,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 01:58:18,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:58:18" (1/1) ... [2024-11-25 01:58:18,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 01:58:18,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 01:58:18,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 01:58:18,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 01:58:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 01:58:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 01:58:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 01:58:18,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 01:58:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-25 01:58:18,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-25 01:58:19,036 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 01:58:19,038 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 01:58:19,531 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 01:58:19,531 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 01:58:19,582 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 01:58:19,582 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 01:58:19,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:58:19 BoogieIcfgContainer [2024-11-25 01:58:19,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 01:58:19,584 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 01:58:19,584 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 01:58:19,595 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 01:58:19,596 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:58:19" (1/1) ... [2024-11-25 01:58:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 01:58:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 129 states and 132 transitions. [2024-11-25 01:58:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2024-11-25 01:58:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-25 01:58:19,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 130 states and 133 transitions. [2024-11-25 01:58:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2024-11-25 01:58:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 01:58:19,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 132 states and 136 transitions. [2024-11-25 01:58:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2024-11-25 01:58:19,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 01:58:19,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 131 states and 135 transitions. [2024-11-25 01:58:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2024-11-25 01:58:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-25 01:58:20,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:20,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:20,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 135 states and 142 transitions. [2024-11-25 01:58:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2024-11-25 01:58:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 01:58:20,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:20,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:20,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 136 states and 143 transitions. [2024-11-25 01:58:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2024-11-25 01:58:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 01:58:20,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:20,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:20,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:20,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 137 states and 144 transitions. [2024-11-25 01:58:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2024-11-25 01:58:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 01:58:20,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 136 states and 143 transitions. [2024-11-25 01:58:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2024-11-25 01:58:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 01:58:20,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:20,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:20,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 138 states and 145 transitions. [2024-11-25 01:58:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2024-11-25 01:58:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 01:58:20,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 146 states and 155 transitions. [2024-11-25 01:58:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2024-11-25 01:58:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 01:58:20,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:20,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 01:58:20,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 154 states and 164 transitions. [2024-11-25 01:58:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2024-11-25 01:58:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 01:58:21,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 155 states and 166 transitions. [2024-11-25 01:58:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2024-11-25 01:58:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 01:58:21,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 156 states and 167 transitions. [2024-11-25 01:58:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2024-11-25 01:58:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 01:58:21,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 155 states and 166 transitions. [2024-11-25 01:58:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2024-11-25 01:58:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 01:58:21,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:21,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:21,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:21,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 157 states and 168 transitions. [2024-11-25 01:58:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2024-11-25 01:58:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 01:58:21,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:21,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:21,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 158 states and 169 transitions. [2024-11-25 01:58:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2024-11-25 01:58:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 01:58:21,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:21,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:21,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 159 states and 170 transitions. [2024-11-25 01:58:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2024-11-25 01:58:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 01:58:21,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:21,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 01:58:21,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 168 states and 179 transitions. [2024-11-25 01:58:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2024-11-25 01:58:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 01:58:22,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:22,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 01:58:22,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 176 states and 188 transitions. [2024-11-25 01:58:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2024-11-25 01:58:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 01:58:22,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 175 states and 187 transitions. [2024-11-25 01:58:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 187 transitions. [2024-11-25 01:58:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 01:58:22,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 177 states and 189 transitions. [2024-11-25 01:58:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2024-11-25 01:58:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 01:58:22,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:22,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 01:58:22,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 181 states and 194 transitions. [2024-11-25 01:58:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2024-11-25 01:58:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 01:58:22,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:22,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 01:58:22,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 185 states and 199 transitions. [2024-11-25 01:58:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 199 transitions. [2024-11-25 01:58:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 01:58:22,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:22,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:23,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 188 states and 205 transitions. [2024-11-25 01:58:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 205 transitions. [2024-11-25 01:58:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 01:58:23,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 213 states and 236 transitions. [2024-11-25 01:58:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 236 transitions. [2024-11-25 01:58:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 01:58:23,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:23,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:23,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 214 states and 237 transitions. [2024-11-25 01:58:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2024-11-25 01:58:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 01:58:23,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:23,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 215 states and 238 transitions. [2024-11-25 01:58:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 238 transitions. [2024-11-25 01:58:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 01:58:23,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 214 states and 237 transitions. [2024-11-25 01:58:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2024-11-25 01:58:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 01:58:23,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 217 states and 241 transitions. [2024-11-25 01:58:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 241 transitions. [2024-11-25 01:58:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-25 01:58:23,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 219 states and 243 transitions. [2024-11-25 01:58:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 243 transitions. [2024-11-25 01:58:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-25 01:58:24,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:24,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 220 states and 244 transitions. [2024-11-25 01:58:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 244 transitions. [2024-11-25 01:58:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 01:58:24,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:24,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:24,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 223 states and 247 transitions. [2024-11-25 01:58:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2024-11-25 01:58:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 01:58:24,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:24,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 222 states and 246 transitions. [2024-11-25 01:58:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 246 transitions. [2024-11-25 01:58:24,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-25 01:58:24,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:24,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:24,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 223 states and 247 transitions. [2024-11-25 01:58:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2024-11-25 01:58:24,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-25 01:58:24,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:24,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:24,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 01:58:24,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 225 states and 249 transitions. [2024-11-25 01:58:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 249 transitions. [2024-11-25 01:58:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 01:58:24,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:24,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-25 01:58:24,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 228 states and 252 transitions. [2024-11-25 01:58:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 252 transitions. [2024-11-25 01:58:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 01:58:25,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:25,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:58:25,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 229 states and 254 transitions. [2024-11-25 01:58:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2024-11-25 01:58:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 01:58:25,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:25,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 237 states and 265 transitions. [2024-11-25 01:58:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2024-11-25 01:58:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 01:58:26,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:26,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 244 states and 275 transitions. [2024-11-25 01:58:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2024-11-25 01:58:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 01:58:26,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 253 states and 287 transitions. [2024-11-25 01:58:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 287 transitions. [2024-11-25 01:58:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 01:58:26,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 261 states and 298 transitions. [2024-11-25 01:58:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 298 transitions. [2024-11-25 01:58:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 01:58:27,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 260 states and 297 transitions. [2024-11-25 01:58:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 297 transitions. [2024-11-25 01:58:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 01:58:27,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:27,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:27,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 01:58:27,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 263 states and 302 transitions. [2024-11-25 01:58:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 302 transitions. [2024-11-25 01:58:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 01:58:28,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:28,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 268 states and 310 transitions. [2024-11-25 01:58:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 310 transitions. [2024-11-25 01:58:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 01:58:29,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:29,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-25 01:58:29,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 272 states and 316 transitions. [2024-11-25 01:58:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 316 transitions. [2024-11-25 01:58:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 01:58:30,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 278 states and 325 transitions. [2024-11-25 01:58:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 325 transitions. [2024-11-25 01:58:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 01:58:31,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 285 states and 335 transitions. [2024-11-25 01:58:32,185 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 335 transitions. [2024-11-25 01:58:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 01:58:32,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:32,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 289 states and 341 transitions. [2024-11-25 01:58:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 341 transitions. [2024-11-25 01:58:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-25 01:58:32,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 288 states and 340 transitions. [2024-11-25 01:58:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 340 transitions. [2024-11-25 01:58:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 01:58:32,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 293 states and 347 transitions. [2024-11-25 01:58:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 347 transitions. [2024-11-25 01:58:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-25 01:58:33,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 302 states and 359 transitions. [2024-11-25 01:58:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 359 transitions. [2024-11-25 01:58:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-25 01:58:34,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 308 states and 367 transitions. [2024-11-25 01:58:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 367 transitions. [2024-11-25 01:58:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-25 01:58:35,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 316 states and 375 transitions. [2024-11-25 01:58:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 375 transitions. [2024-11-25 01:58:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 01:58:35,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:35,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 315 states and 374 transitions. [2024-11-25 01:58:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 374 transitions. [2024-11-25 01:58:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-25 01:58:36,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:36,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:36,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 01:58:36,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 323 states and 385 transitions. [2024-11-25 01:58:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 385 transitions. [2024-11-25 01:58:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-25 01:58:37,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 335 states and 400 transitions. [2024-11-25 01:58:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 400 transitions. [2024-11-25 01:58:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 01:58:38,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:38,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-25 01:58:38,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 341 states and 406 transitions. [2024-11-25 01:58:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 406 transitions. [2024-11-25 01:58:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-25 01:58:39,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:39,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 342 states and 407 transitions. [2024-11-25 01:58:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 407 transitions. [2024-11-25 01:58:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-25 01:58:39,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:39,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-25 01:58:39,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 344 states and 412 transitions. [2024-11-25 01:58:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 412 transitions. [2024-11-25 01:58:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-25 01:58:40,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:40,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 343 states and 411 transitions. [2024-11-25 01:58:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 411 transitions. [2024-11-25 01:58:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-25 01:58:40,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 346 states and 417 transitions. [2024-11-25 01:58:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 417 transitions. [2024-11-25 01:58:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-25 01:58:41,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:41,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 348 states and 419 transitions. [2024-11-25 01:58:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 419 transitions. [2024-11-25 01:58:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-25 01:58:41,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:41,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 352 states and 424 transitions. [2024-11-25 01:58:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 424 transitions. [2024-11-25 01:58:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-25 01:58:42,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 355 states and 427 transitions. [2024-11-25 01:58:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 427 transitions. [2024-11-25 01:58:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-25 01:58:43,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 359 states and 431 transitions. [2024-11-25 01:58:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 431 transitions. [2024-11-25 01:58:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-25 01:58:43,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:58:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:43,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 01:58:43,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:58:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 362 states and 434 transitions. [2024-11-25 01:58:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 434 transitions. [2024-11-25 01:58:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-25 01:58:43,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 367 states and 439 transitions. [2024-11-25 01:58:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 439 transitions. [2024-11-25 01:58:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-25 01:58:45,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 368 states and 441 transitions. [2024-11-25 01:58:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 441 transitions. [2024-11-25 01:58:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-25 01:58:46,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 374 states and 447 transitions. [2024-11-25 01:58:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 447 transitions. [2024-11-25 01:58:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-25 01:58:48,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 376 states and 450 transitions. [2024-11-25 01:58:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 450 transitions. [2024-11-25 01:58:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-25 01:58:49,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 375 states and 449 transitions. [2024-11-25 01:58:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 449 transitions. [2024-11-25 01:58:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-25 01:58:49,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 379 states and 459 transitions. [2024-11-25 01:58:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 459 transitions. [2024-11-25 01:58:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-25 01:58:52,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:58:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 378 states and 458 transitions. [2024-11-25 01:58:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 458 transitions. [2024-11-25 01:58:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-25 01:58:53,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:53,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 387 states and 470 transitions. [2024-11-25 01:58:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 470 transitions. [2024-11-25 01:58:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-25 01:58:56,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:56,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:59:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 396 states and 479 transitions. [2024-11-25 01:59:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 479 transitions. [2024-11-25 01:59:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-25 01:59:00,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:00,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:59:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 395 states and 478 transitions. [2024-11-25 01:59:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 478 transitions. [2024-11-25 01:59:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-25 01:59:01,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:59:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 396 states and 479 transitions. [2024-11-25 01:59:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 479 transitions. [2024-11-25 01:59:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-25 01:59:02,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:59:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:02,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-25 01:59:02,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:59:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:59:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 408 states and 492 transitions. [2024-11-25 01:59:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 492 transitions. [2024-11-25 01:59:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-25 01:59:06,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:06,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:59:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:06,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-25 01:59:06,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:59:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:59:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 419 states and 503 transitions. [2024-11-25 01:59:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 503 transitions. [2024-11-25 01:59:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 01:59:07,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:59:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:07,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 01:59:07,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:59:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:59:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 423 states and 508 transitions. [2024-11-25 01:59:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 508 transitions. [2024-11-25 01:59:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-25 01:59:08,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:08,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:59:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:08,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:59:08,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:59:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 01:59:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 482 states and 576 transitions. [2024-11-25 01:59:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 576 transitions. [2024-11-25 01:59:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-25 01:59:11,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:59:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 202 states and 224 transitions. [2024-11-25 01:59:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2024-11-25 01:59:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-25 01:59:13,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:13,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:59:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:13,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:59:13,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:59:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:59:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 201 states and 223 transitions. [2024-11-25 01:59:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2024-11-25 01:59:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-25 01:59:15,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 01:59:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 198 states and 220 transitions. [2024-11-25 01:59:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2024-11-25 01:59:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-25 01:59:17,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:59:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:17,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 01:59:17,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:59:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 01:59:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 197 states and 219 transitions. [2024-11-25 01:59:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2024-11-25 01:59:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-25 01:59:19,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 01:59:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:19,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 01:59:19,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 01:59:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:59:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 196 states and 218 transitions. [2024-11-25 01:59:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2024-11-25 01:59:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-25 01:59:20,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:20,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-25 01:59:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 195 states and 217 transitions. [2024-11-25 01:59:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 217 transitions. [2024-11-25 01:59:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-25 01:59:22,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 01:59:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 194 states and 216 transitions. [2024-11-25 01:59:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2024-11-25 01:59:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-25 01:59:24,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:24,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:59:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 192 states and 212 transitions. [2024-11-25 01:59:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2024-11-25 01:59:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-25 01:59:25,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:59:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 192 states and 211 transitions. [2024-11-25 01:59:25,784 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2024-11-25 01:59:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-25 01:59:25,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:25,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:59:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 188 states and 207 transitions. [2024-11-25 01:59:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2024-11-25 01:59:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 01:59:26,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:59:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 186 states and 202 transitions. [2024-11-25 01:59:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 202 transitions. [2024-11-25 01:59:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 01:59:28,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:28,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:59:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 181 states and 197 transitions. [2024-11-25 01:59:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2024-11-25 01:59:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 01:59:29,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:29,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:59:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 179 states and 192 transitions. [2024-11-25 01:59:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions. [2024-11-25 01:59:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 01:59:31,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:31,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:59:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 173 states and 186 transitions. [2024-11-25 01:59:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 186 transitions. [2024-11-25 01:59:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 01:59:31,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:59:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 171 states and 182 transitions. [2024-11-25 01:59:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2024-11-25 01:59:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 01:59:33,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:33,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:59:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 171 states and 181 transitions. [2024-11-25 01:59:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2024-11-25 01:59:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 01:59:34,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:59:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 163 states and 173 transitions. [2024-11-25 01:59:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2024-11-25 01:59:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-25 01:59:35,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:35,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-25 01:59:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 154 states and 164 transitions. [2024-11-25 01:59:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2024-11-25 01:59:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-25 01:59:37,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:37,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 01:59:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 153 states and 163 transitions. [2024-11-25 01:59:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2024-11-25 01:59:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 01:59:39,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 01:59:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 152 states and 162 transitions. [2024-11-25 01:59:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2024-11-25 01:59:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 01:59:41,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 01:59:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 149 states and 159 transitions. [2024-11-25 01:59:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2024-11-25 01:59:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-25 01:59:43,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 01:59:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 145 states and 155 transitions. [2024-11-25 01:59:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2024-11-25 01:59:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-25 01:59:45,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 01:59:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 140 states and 150 transitions. [2024-11-25 01:59:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2024-11-25 01:59:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-25 01:59:47,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:47,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-25 01:59:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 134 states and 144 transitions. [2024-11-25 01:59:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2024-11-25 01:59:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 01:59:54,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:54,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 01:59:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 127 states and 137 transitions. [2024-11-25 01:59:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2024-11-25 01:59:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-25 01:59:57,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-25 02:00:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:00:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 137 states and 147 transitions. [2024-11-25 02:00:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2024-11-25 02:00:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-25 02:00:04,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:00:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:00:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:00:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-25 02:00:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:00:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 117 states and 127 transitions. [2024-11-25 02:00:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2024-11-25 02:00:06,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 02:00:06,243 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 108 iterations. [2024-11-25 02:00:06,253 INFO L726 CodeCheckObserver]: All specifications hold 60 specifications checked. All of them hold [2024-11-25 02:00:14,359 INFO L77 FloydHoareUtils]: At program point L35-2(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,359 INFO L77 FloydHoareUtils]: At program point L35-3(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,359 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,359 INFO L77 FloydHoareUtils]: At program point L35-4(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,359 INFO L77 FloydHoareUtils]: At program point L35-5(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,359 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point L27-2(lines 27 36) the Hoare annotation is: true [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point L27-3(lines 27 36) the Hoare annotation is: true [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) the Hoare annotation is: true [2024-11-25 02:00:14,360 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,360 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-11-25 02:00:14,360 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,360 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point L28(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point L28-1(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point L28-2(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-11-25 02:00:14,360 INFO L77 FloydHoareUtils]: At program point L28-3(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-4(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-5(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-6(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-7(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-8(line 28) the Hoare annotation is: (not (and (< (+ 9223372036854775807 (* |ULTIMATE.start_main_~x~0#1| 4)) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (< 0 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-9(line 28) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (not (= |ULTIMATE.start_main_~y~0#1| 1)) (and (<= .cse0 (+ 9223372036854775807 .cse1)) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= .cse1 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse0))))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-10(line 28) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (not (= |ULTIMATE.start_main_~y~0#1| 1)) (and (<= .cse0 (+ 9223372036854775807 .cse1)) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= .cse1 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse0))))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-11(line 28) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (not (= |ULTIMATE.start_main_~y~0#1| 1)) (and (<= .cse0 (+ 9223372036854775807 .cse1)) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= .cse1 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse0))))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-12(line 28) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (not (= |ULTIMATE.start_main_~y~0#1| 1)) (and (<= .cse0 (+ 9223372036854775807 .cse1)) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= .cse1 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse0))))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-13(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-14(line 28) the Hoare annotation is: (not (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 (* .cse0 2)) (.cse3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (< 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= .cse0 2305843009213693951) (<= .cse1 (+ .cse2 9223372036854775807 .cse3)) (<= (+ .cse2 .cse3) (+ 9223372036854775807 .cse1)))))) [2024-11-25 02:00:14,361 INFO L77 FloydHoareUtils]: At program point L28-15(line 28) the Hoare annotation is: (not (let ((.cse1 (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2)) (.cse2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (< 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= .cse0 (+ .cse1 9223372036854775807 .cse2)) (<= (+ .cse1 .cse2) (+ 9223372036854775807 .cse0))))) [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L28-16(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L28-17(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L28-18(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L28-19(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L28-20(line 28) the Hoare annotation is: (let ((.cse1 (< 0 (+ 2305843009213693953 |ULTIMATE.start_main_~x~0#1|))) (.cse3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse2 (+ 9223372036854775809 (* |ULTIMATE.start_main_~x~0#1| 4)))) (or (and (<= .cse0 9223372036854775807) .cse1 (<= .cse2 .cse0)) (and .cse1 (<= |ULTIMATE.start_main_~x~0#1| 2305843009213693951) (< 9223372036854775807 .cse0)) (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 4611686018427387904)))) (= |ULTIMATE.start_main_~y~0#1| 0) (not (and (<= |ULTIMATE.start_main_~x~0#1| .cse3) (<= .cse3 4611686018427387903))) (< (+ (* .cse3 2) .cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse2) (< |ULTIMATE.start_main_~c~0#1| 1))) [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L28-21(line 28) the Hoare annotation is: (let ((.cse0 (+ 9223372036854775809 (* |ULTIMATE.start_main_~x~0#1| 4))) (.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (<= .cse0 .cse1) (< (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) .cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse0) (< |ULTIMATE.start_main_~c~0#1| 1) (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))) (< 9223372036854775807 .cse1))) [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L28-22(lines 27 36) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 0))) (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse6 (not .cse0)) (.cse4 (<= 1 |ULTIMATE.start_main_~c~0#1|))) (or (and (<= 0 |ULTIMATE.start_main_~x~0#1|) .cse0 (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 (+ 9223372036854775809 .cse1)) (< 0 (+ 2305843009213693953 |ULTIMATE.start_main_~x~0#1|)) (<= .cse1 9223372036854775807) (< 9223372036854775807 .cse2)) (and .cse0 (not (= |ULTIMATE.start_main_~c~0#1| 0))) (< 4611686018427387903 .cse3) (let ((.cse5 (+ 9223372036854775809 (* |ULTIMATE.start_main_~x~0#1| 4)))) (and .cse4 (< (+ (* .cse1 2) .cse2 .cse3) .cse5) (< .cse2 .cse5))) (and .cse6 (< |ULTIMATE.start_main_~c~0#1| 1)) (and .cse6 (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1)))) (and .cse4 (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|))))) [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L37(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L37-1(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,362 INFO L77 FloydHoareUtils]: At program point L37-2(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,363 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,363 INFO L77 FloydHoareUtils]: At program point L37-3(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,363 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,363 INFO L77 FloydHoareUtils]: At program point L37-4(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,363 INFO L77 FloydHoareUtils]: At program point L37-5(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,363 INFO L77 FloydHoareUtils]: At program point L37-6(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,363 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,363 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,363 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-11-25 02:00:14,364 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,364 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,365 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 02:00:14,365 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,365 INFO L77 FloydHoareUtils]: At program point L38(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,365 INFO L77 FloydHoareUtils]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-11-25 02:00:14,365 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,365 INFO L77 FloydHoareUtils]: At program point L38-2(line 38) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-11-25 02:00:14,365 INFO L77 FloydHoareUtils]: At program point L38-3(line 38) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-11-25 02:00:14,366 INFO L77 FloydHoareUtils]: At program point L38-4(line 38) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-11-25 02:00:14,366 INFO L77 FloydHoareUtils]: At program point L38-5(line 38) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-11-25 02:00:14,366 INFO L77 FloydHoareUtils]: At program point L38-6(line 38) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-11-25 02:00:14,366 INFO L77 FloydHoareUtils]: At program point L38-7(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (<= (+ 9223372036854775809 .cse0) .cse1) (let ((.cse2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 (+ (* .cse2 2) 9223372036854775807 .cse1)) (<= .cse2 4611686018427387903) (< 0 (+ .cse2 4611686018427387905)) (<= .cse0 (+ 9223372036854775807 .cse1)))))) [2024-11-25 02:00:14,366 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,366 INFO L77 FloydHoareUtils]: At program point L38-8(line 38) the Hoare annotation is: (let ((.cse8 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse4 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse5 (* .cse8 2)) (.cse6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (+ .cse5 .cse6)) (.cse2 (<= .cse8 4611686018427387903)) (.cse0 (+ 9223372036854775809 .cse4)) (.cse7 (+ .cse5 .cse6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse3 (< 0 (+ .cse8 4611686018427387905)))) (or (and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (<= .cse0 .cse1) .cse2 .cse3) (and (<= .cse4 (+ .cse5 9223372036854775807 .cse6)) (< .cse7 .cse0) .cse2 .cse3 (<= .cse4 (+ 9223372036854775807 .cse6))) (and (< .cse1 .cse0) .cse2 (<= .cse0 .cse7) .cse3))))) [2024-11-25 02:00:14,366 INFO L77 FloydHoareUtils]: At program point L38-9(line 38) the Hoare annotation is: (let ((.cse8 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse4 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse5 (* .cse8 2)) (.cse6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (+ .cse5 .cse6)) (.cse2 (<= .cse8 4611686018427387903)) (.cse0 (+ 9223372036854775809 .cse4)) (.cse7 (+ .cse5 .cse6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse3 (< 0 (+ .cse8 4611686018427387905)))) (or (and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (<= .cse0 .cse1) .cse2 .cse3) (and (<= .cse4 (+ .cse5 9223372036854775807 .cse6)) (< .cse7 .cse0) .cse2 .cse3) (and (< .cse1 .cse0) .cse2 (<= .cse0 .cse7) .cse3))))) [2024-11-25 02:00:14,367 INFO L77 FloydHoareUtils]: At program point L38-10(line 38) the Hoare annotation is: (let ((.cse8 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse4 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse5 (* .cse8 2)) (.cse6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (+ .cse5 .cse6)) (.cse2 (<= .cse8 4611686018427387903)) (.cse0 (+ 9223372036854775809 .cse4)) (.cse7 (+ .cse5 .cse6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse3 (< 0 (+ .cse8 4611686018427387905)))) (or (and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (<= .cse0 .cse1) .cse2 .cse3) (and (<= .cse4 (+ .cse5 9223372036854775807 .cse6)) (< .cse7 .cse0) .cse2 .cse3) (and (< .cse1 .cse0) .cse2 (<= .cse0 .cse7) .cse3))))) [2024-11-25 02:00:14,367 INFO L77 FloydHoareUtils]: At program point L38-11(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* .cse0 2) 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (<= .cse0 4611686018427387903) (< 0 (+ .cse0 4611686018427387905)))) [2024-11-25 02:00:14,367 INFO L77 FloydHoareUtils]: At program point L38-12(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* .cse0 2) 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (<= .cse0 4611686018427387903) (< 0 (+ .cse0 4611686018427387905)))) [2024-11-25 02:00:14,367 INFO L77 FloydHoareUtils]: At program point L38-13(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* .cse0 2) 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (<= .cse0 4611686018427387903) (< 0 (+ .cse0 4611686018427387905)))) [2024-11-25 02:00:14,367 INFO L77 FloydHoareUtils]: At program point L38-14(line 38) the Hoare annotation is: (let ((.cse4 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse1 (* .cse4 2)) (.cse2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse3 (<= .cse4 4611686018427387903))) (or (and (<= .cse0 (+ .cse1 9223372036854775807 .cse2)) .cse3 (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 9223372036854775807)) (and (<= (+ 9223372036854775809 .cse0) (+ .cse1 .cse2)) .cse3)))) [2024-11-25 02:00:14,367 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,367 INFO L77 FloydHoareUtils]: At program point L38-15(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse1 (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2)) (.cse2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (and (<= .cse0 (+ .cse1 9223372036854775807 .cse2)) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 9223372036854775807)) (<= (+ 9223372036854775809 .cse0) (+ .cse1 .cse2)))) [2024-11-25 02:00:14,368 INFO L77 FloydHoareUtils]: At program point L38-16(line 38) the Hoare annotation is: (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 9223372036854775807)) [2024-11-25 02:00:14,368 INFO L77 FloydHoareUtils]: At program point L38-17(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0)) (<= .cse0 9223372036854775807))) [2024-11-25 02:00:14,368 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,368 INFO L77 FloydHoareUtils]: At program point L38-18(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0)) (<= .cse0 9223372036854775807))) [2024-11-25 02:00:14,368 INFO L77 FloydHoareUtils]: At program point L38-19(line 38) the Hoare annotation is: (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) [2024-11-25 02:00:14,368 INFO L77 FloydHoareUtils]: At program point L38-20(line 38) the Hoare annotation is: (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) [2024-11-25 02:00:14,368 INFO L77 FloydHoareUtils]: At program point L38-21(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,369 INFO L77 FloydHoareUtils]: At program point L38-22(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,369 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,369 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,369 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,369 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,369 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-11-25 02:00:14,369 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2024-11-25 02:00:14,369 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,369 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,370 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,370 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,370 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,370 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,370 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,370 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,370 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-11-25 02:00:14,370 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,370 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,371 INFO L77 FloydHoareUtils]: At program point L33(line 33) the Hoare annotation is: (not (and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (not (and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 0))))) [2024-11-25 02:00:14,371 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 02:00:14,371 INFO L77 FloydHoareUtils]: At program point L33-1(line 33) the Hoare annotation is: (not (and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (not (and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 0))))) [2024-11-25 02:00:14,371 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,371 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,371 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,371 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,371 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-11-25 02:00:14,371 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,372 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,372 INFO L77 FloydHoareUtils]: At program point L34(line 34) the Hoare annotation is: true [2024-11-25 02:00:14,372 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) the Hoare annotation is: true [2024-11-25 02:00:14,372 INFO L77 FloydHoareUtils]: At program point L34-1(line 34) the Hoare annotation is: true [2024-11-25 02:00:14,372 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-11-25 02:00:14,372 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,372 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,372 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2024-11-25 02:00:14,372 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-11-25 02:00:14,372 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,373 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-11-25 02:00:14,373 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-11-25 02:00:14,373 INFO L77 FloydHoareUtils]: At program point L35(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,373 INFO L77 FloydHoareUtils]: At program point L35-1(line 35) the Hoare annotation is: true [2024-11-25 02:00:14,373 INFO L77 FloydHoareUtils]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (not (= |__VERIFIER_assert_#in~cond#1| 0)) [2024-11-25 02:00:14,373 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2024-11-25 02:00:14,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 02:00:14 ImpRootNode [2024-11-25 02:00:14,395 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 02:00:14,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 02:00:14,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 02:00:14,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 02:00:14,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:58:19" (3/4) ... [2024-11-25 02:00:14,399 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 02:00:14,403 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-25 02:00:14,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-25 02:00:14,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-25 02:00:14,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-25 02:00:14,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 02:00:14,510 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 02:00:14,511 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 02:00:14,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 02:00:14,512 INFO L158 Benchmark]: Toolchain (without parser) took 116036.48ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 92.1MB in the beginning and 240.6MB in the end (delta: -148.5MB). Peak memory consumption was 425.3MB. Max. memory is 16.1GB. [2024-11-25 02:00:14,512 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 83.9MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:00:14,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.91ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 80.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:00:14,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.51ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:00:14,514 INFO L158 Benchmark]: Boogie Preprocessor took 36.71ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 78.1MB in the end (delta: 857.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:00:14,514 INFO L158 Benchmark]: RCFGBuilder took 690.26ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 54.8MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 02:00:14,514 INFO L158 Benchmark]: CodeCheck took 114811.61ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 54.8MB in the beginning and 244.8MB in the end (delta: -190.0MB). Peak memory consumption was 391.7MB. Max. memory is 16.1GB. [2024-11-25 02:00:14,515 INFO L158 Benchmark]: Witness Printer took 114.72ms. Allocated memory is still 696.3MB. Free memory was 244.8MB in the beginning and 240.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:00:14,517 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 2 procedures, 129 locations, 60 error locations. Started 1 CEGAR loops. OverallTime: 106.6s, OverallIterations: 108, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57595 SdHoareTripleChecker+Valid, 184.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50568 mSDsluCounter, 4031 SdHoareTripleChecker+Invalid, 158.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 12594 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129361 IncrementalHoareTripleChecker+Invalid, 141955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12594 mSolverCounterUnsat, 3861 mSDtfsCounter, 129361 mSolverCounterSat, 3.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36752 GetRequests, 33881 SyntacticMatches, 2089 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422271 ImplicationChecksByTransitivity, 91.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 4959 NumberOfCodeBlocks, 4959 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 4852 ConstructedInterpolants, 0 QuantifiedInterpolants, 21842 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2189 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 107 InterpolantComputations, 93 PerfectInterpolantSequences, 890/1093 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 60 specifications checked. All of them hold - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 83.9MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.91ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 80.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.51ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.71ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 78.1MB in the end (delta: 857.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 690.26ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 54.8MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 114811.61ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 54.8MB in the beginning and 244.8MB in the end (delta: -190.0MB). Peak memory consumption was 391.7MB. Max. memory is 16.1GB. * Witness Printer took 114.72ms. Allocated memory is still 696.3MB. Free memory was 244.8MB in the beginning and 240.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 02:00:14,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34f4b878-5eaf-4a5f-a7fc-b1850878a26b/bin/ukojak-verify-ENZ3QT5qd3/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