./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:11:12,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:11:13,063 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:11:13,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:11:13,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:11:13,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:11:13,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:11:13,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:11:13,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:11:13,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:11:13,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:11:13,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:11:13,107 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:11:13,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:11:13,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:11:13,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:11:13,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:11:13,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:11:13,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:11:13,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:11:13,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:11:13,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:11:13,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:11:13,115 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:11:13,115 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:11:13,115 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:11:13,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:11:13,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:11:13,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:11:13,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:11:13,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:11:13,117 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:11:13,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:11:13,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 [2024-11-09 00:11:13,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:11:13,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:11:13,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:11:13,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:11:13,428 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:11:13,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c Unable to find full path for "g++" [2024-11-09 00:11:15,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:11:15,784 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:11:15,785 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-09 00:11:15,793 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/data/91bdd5439/35f108188da645ea8a4d7779482a2cc8/FLAGc48060f1c [2024-11-09 00:11:15,807 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/data/91bdd5439/35f108188da645ea8a4d7779482a2cc8 [2024-11-09 00:11:15,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:11:15,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:11:15,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:11:15,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:11:15,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:11:15,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@773705fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15, skipping insertion in model container [2024-11-09 00:11:15,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:11:16,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-09 00:11:16,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:11:16,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:11:16,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-09 00:11:16,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:11:16,157 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:11:16,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16 WrapperNode [2024-11-09 00:11:16,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:11:16,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:11:16,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:11:16,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:11:16,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,207 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2024-11-09 00:11:16,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:11:16,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:11:16,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:11:16,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:11:16,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:11:16,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:11:16,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:11:16,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:11:16,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:11:16,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:11:16,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:11:16,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:11:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:11:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:11:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 00:11:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:11:16,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:11:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 00:11:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-09 00:11:16,330 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-09 00:11:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-09 00:11:16,330 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-09 00:11:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 00:11:16,436 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:11:16,438 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:11:16,765 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-11-09 00:11:16,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:11:16,850 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:11:16,851 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 00:11:16,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:11:16 BoogieIcfgContainer [2024-11-09 00:11:16,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:11:16,854 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:11:16,858 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:11:16,870 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:11:16,870 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:11:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 50 states and 69 transitions. [2024-11-09 00:11:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2024-11-09 00:11:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:11:17,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:17,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:17,438 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-09 00:11:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 52 states and 70 transitions. [2024-11-09 00:11:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2024-11-09 00:11:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:11:17,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:17,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:17,697 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-09 00:11:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 53 states and 72 transitions. [2024-11-09 00:11:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2024-11-09 00:11:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 00:11:17,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:17,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:17,877 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-09 00:11:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 54 states and 73 transitions. [2024-11-09 00:11:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-09 00:11:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:11:17,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:17,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:18,049 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-09 00:11:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 56 states and 76 transitions. [2024-11-09 00:11:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-09 00:11:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:11:18,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:18,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:18,230 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-09 00:11:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 58 states and 78 transitions. [2024-11-09 00:11:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-09 00:11:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:11:18,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:18,373 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-09 00:11:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 62 states and 82 transitions. [2024-11-09 00:11:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-11-09 00:11:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 00:11:18,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:18,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:11:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 64 states and 84 transitions. [2024-11-09 00:11:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2024-11-09 00:11:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 00:11:18,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:18,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:11:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 66 states and 86 transitions. [2024-11-09 00:11:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2024-11-09 00:11:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 00:11:18,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:11:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 68 states and 88 transitions. [2024-11-09 00:11:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2024-11-09 00:11:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 00:11:18,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 00:11:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 69 states and 88 transitions. [2024-11-09 00:11:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-11-09 00:11:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 00:11:19,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 00:11:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 70 states and 90 transitions. [2024-11-09 00:11:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-09 00:11:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 00:11:19,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 00:11:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 70 states and 89 transitions. [2024-11-09 00:11:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-11-09 00:11:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 00:11:19,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:19,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 00:11:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 75 states and 97 transitions. [2024-11-09 00:11:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2024-11-09 00:11:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 00:11:20,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 00:11:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 75 states and 96 transitions. [2024-11-09 00:11:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2024-11-09 00:11:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 00:11:20,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 00:11:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 76 states and 97 transitions. [2024-11-09 00:11:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2024-11-09 00:11:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 00:11:20,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 00:11:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 79 states and 101 transitions. [2024-11-09 00:11:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2024-11-09 00:11:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:11:20,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 00:11:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 82 states and 105 transitions. [2024-11-09 00:11:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2024-11-09 00:11:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 00:11:21,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 00:11:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 85 states and 109 transitions. [2024-11-09 00:11:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2024-11-09 00:11:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 00:11:22,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:22,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 00:11:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 88 states and 113 transitions. [2024-11-09 00:11:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2024-11-09 00:11:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 00:11:22,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 00:11:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 91 states and 117 transitions. [2024-11-09 00:11:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2024-11-09 00:11:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:11:23,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 00:11:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 94 states and 120 transitions. [2024-11-09 00:11:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2024-11-09 00:11:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:11:23,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:23,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-09 00:11:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 98 states and 126 transitions. [2024-11-09 00:11:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2024-11-09 00:11:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 00:11:24,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-09 00:11:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 104 states and 135 transitions. [2024-11-09 00:11:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2024-11-09 00:11:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 00:11:26,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 82 proven. 7 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-09 00:11:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 106 states and 138 transitions. [2024-11-09 00:11:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2024-11-09 00:11:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:11:26,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 48 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 00:11:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 109 states and 142 transitions. [2024-11-09 00:11:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2024-11-09 00:11:27,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:11:27,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 119 proven. 22 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-09 00:11:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 119 states and 155 transitions. [2024-11-09 00:11:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 155 transitions. [2024-11-09 00:11:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:11:30,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 82 proven. 4 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-09 00:11:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 120 states and 157 transitions. [2024-11-09 00:11:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2024-11-09 00:11:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:11:30,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 118 proven. 7 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-09 00:11:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 117 states and 149 transitions. [2024-11-09 00:11:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2024-11-09 00:11:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 00:11:30,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:30,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 133 proven. 88 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 00:11:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 120 states and 154 transitions. [2024-11-09 00:11:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2024-11-09 00:11:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 00:11:31,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 236 proven. 46 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 00:11:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 133 states and 173 transitions. [2024-11-09 00:11:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2024-11-09 00:11:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 00:11:34,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 272 proven. 56 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 00:11:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 135 states and 176 transitions. [2024-11-09 00:11:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2024-11-09 00:11:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 00:11:35,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 268 proven. 15 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-09 00:11:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 137 states and 178 transitions. [2024-11-09 00:11:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2024-11-09 00:11:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:11:36,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:36,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 267 proven. 120 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-09 00:11:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 140 states and 182 transitions. [2024-11-09 00:11:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2024-11-09 00:11:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 00:11:37,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 420 proven. 79 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-09 00:11:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 154 states and 199 transitions. [2024-11-09 00:11:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 199 transitions. [2024-11-09 00:11:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 00:11:40,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:40,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 522 proven. 36 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2024-11-09 00:11:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 156 states and 201 transitions. [2024-11-09 00:11:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2024-11-09 00:11:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:11:41,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 459 proven. 155 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-09 00:11:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 159 states and 204 transitions. [2024-11-09 00:11:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 204 transitions. [2024-11-09 00:11:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 00:11:42,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 413 proven. 348 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-09 00:11:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 174 states and 219 transitions. [2024-11-09 00:11:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2024-11-09 00:11:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 00:11:44,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:44,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:11:44,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:11:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:11:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:11:45,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:11:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:11:45,612 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 38 iterations. [2024-11-09 00:11:45,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:11:45 ImpRootNode [2024-11-09 00:11:45,728 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:11:45,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:11:45,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:11:45,728 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:11:45,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:11:16" (3/4) ... [2024-11-09 00:11:45,730 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 00:11:45,814 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:11:45,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:11:45,815 INFO L158 Benchmark]: Toolchain (without parser) took 30003.21ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 136.4MB in the beginning and 193.7MB in the end (delta: -57.3MB). Peak memory consumption was 200.0MB. Max. memory is 16.1GB. [2024-11-09 00:11:45,815 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 119.5MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:11:45,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.31ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 122.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:11:45,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.04ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 120.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:11:45,816 INFO L158 Benchmark]: Boogie Preprocessor took 50.45ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:11:45,817 INFO L158 Benchmark]: RCFGBuilder took 593.76ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 95.5MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 00:11:45,817 INFO L158 Benchmark]: CodeCheck took 28873.92ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 95.5MB in the beginning and 201.1MB in the end (delta: -105.6MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. [2024-11-09 00:11:45,818 INFO L158 Benchmark]: Witness Printer took 85.96ms. Allocated memory is still 423.6MB. Free memory was 201.1MB in the beginning and 193.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:11:45,820 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 3 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.7s, OverallIterations: 38, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6969 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2129 mSDsluCounter, 2081 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 2802 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9825 IncrementalHoareTripleChecker+Invalid, 12627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2802 mSolverCounterUnsat, 2031 mSDtfsCounter, 9825 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17930 GetRequests, 17329 SyntacticMatches, 287 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53358 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 3115 NumberOfCodeBlocks, 3115 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2912 ConstructedInterpolants, 0 QuantifiedInterpolants, 4414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 14 PerfectInterpolantSequences, 6705/7911 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 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={17574:0}, i=0] [L38] COND FALSE !(i < 7) VAL [d={17574:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={17574:0}, i=0, j=1] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=0, j=1] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=0, j=2] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=0, j=2] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=0, j=3] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=0, j=3] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=0, j=4] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=0, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=0, j=5] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=0, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=0, j=6] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=0, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=0, j=7] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=0, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=0, j=8] [L39] COND TRUE j < 8 VAL [d={17574:0}, i=0] [L38] i++ VAL [d={17574:0}, i=1] [L38] COND FALSE !(i < 7) VAL [d={17574:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={17574:0}, i=1, j=2] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=1, j=2] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=1, j=3] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=1, j=3] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=1, j=4] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=1, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=1, j=5] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=1, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=1, j=6] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=1, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=1, j=7] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=1, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=1, j=8] [L39] COND TRUE j < 8 VAL [d={17574:0}, i=1] [L38] i++ VAL [d={17574:0}, i=2] [L38] COND FALSE !(i < 7) VAL [d={17574:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={17574:0}, i=2, j=3] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=2, j=3] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=2, j=4] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=2, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=2, j=5] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=2, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=2, j=6] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=2, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=2, j=7] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=2, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=2, j=8] [L39] COND TRUE j < 8 VAL [d={17574:0}, i=2] [L38] i++ VAL [d={17574:0}, i=3] [L38] COND FALSE !(i < 7) VAL [d={17574:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={17574:0}, i=3, j=4] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=3, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=3, j=5] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=3, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=3, j=6] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=3, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=3, j=7] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=3, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=3, j=8] [L39] COND TRUE j < 8 VAL [d={17574:0}, i=3] [L38] i++ VAL [d={17574:0}, i=4] [L38] COND FALSE !(i < 7) VAL [d={17574:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={17574:0}, i=4, j=5] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=4, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=4, j=6] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=4, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=4, j=7] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=4, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=4, j=8] [L39] COND TRUE j < 8 VAL [d={17574:0}, i=4] [L38] i++ VAL [d={17574:0}, i=5] [L38] COND FALSE !(i < 7) VAL [d={17574:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={17574:0}, i=5, j=6] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=5, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=5, j=7] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=5, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=5, j=8] [L39] COND TRUE j < 8 VAL [d={17574:0}, i=5] [L38] i++ VAL [d={17574:0}, i=6] [L38] COND FALSE !(i < 7) VAL [d={17574:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={17574:0}, i=6, j=7] [L39] COND FALSE !(j < 8) VAL [d={17574:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={17574:0}, i=6, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={17574:0}, i=6, j=8] [L39] COND TRUE j < 8 VAL [d={17574:0}, i=6] [L38] i++ VAL [d={17574:0}, i=7] [L38] COND TRUE i < 7 VAL [d={17574:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 119.5MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.31ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 122.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.04ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 120.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.45ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 593.76ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 95.5MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 28873.92ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 95.5MB in the beginning and 201.1MB in the end (delta: -105.6MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. * Witness Printer took 85.96ms. Allocated memory is still 423.6MB. Free memory was 201.1MB in the beginning and 193.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 00:11:45,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43a1526-d74f-4e42-9d64-4ea34fd82506/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE