./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:36:12,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:36:12,816 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:36:12,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:36:12,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:36:12,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:36:12,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:36:12,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:36:12,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:36:12,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:36:12,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:36:12,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:36:12,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:36:12,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:36:12,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:36:12,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:36:12,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:36:12,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:36:12,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:36:12,854 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:36:12,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:36:12,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:36:12,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:36:12,855 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:36:12,855 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:36:12,855 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:36:12,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:36:12,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:36:12,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:36:12,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:36:12,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:36:12,856 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:36:12,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:36:12,856 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_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 [2024-11-13 22:36:13,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:36:13,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:36:13,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:36:13,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:36:13,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:36:13,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c Unable to find full path for "g++" [2024-11-13 22:36:15,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:36:15,335 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:36:15,339 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-13 22:36:15,362 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/data/783cb587d/eaa0a586e39d435fb0fa949173dc9d9e/FLAG96eeea89f [2024-11-13 22:36:15,648 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/data/783cb587d/eaa0a586e39d435fb0fa949173dc9d9e [2024-11-13 22:36:15,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:36:15,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:36:15,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:36:15,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:36:15,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:36:15,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399d7114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15, skipping insertion in model container [2024-11-13 22:36:15,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:36:15,832 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_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-13 22:36:15,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:36:15,890 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:36:15,898 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_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-13 22:36:15,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:36:15,927 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:36:15,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15 WrapperNode [2024-11-13 22:36:15,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:36:15,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:36:15,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:36:15,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:36:15,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,963 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2024-11-13 22:36:15,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:36:15,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:36:15,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:36:15,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:36:15,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:36:15,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:36:15,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:36:15,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:36:15,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:36:15" (1/1) ... [2024-11-13 22:36:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:36:16,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:36:16,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:36:16,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:36:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:36:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:36:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 22:36:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:36:16,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:36:16,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 22:36:16,070 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-13 22:36:16,070 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-13 22:36:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-13 22:36:16,071 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-13 22:36:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 22:36:16,186 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:36:16,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:36:16,561 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-13 22:36:16,561 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:36:16,653 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:36:16,653 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 22:36:16,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:36:16 BoogieIcfgContainer [2024-11-13 22:36:16,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:36:16,654 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:36:16,654 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:36:16,665 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:36:16,666 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:36:16" (1/1) ... [2024-11-13 22:36:16,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:36:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 46 states and 63 transitions. [2024-11-13 22:36:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-11-13 22:36:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 22:36:16,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:36:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 48 states and 64 transitions. [2024-11-13 22:36:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-11-13 22:36:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 22:36:17,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:17,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:36:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 49 states and 66 transitions. [2024-11-13 22:36:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-11-13 22:36:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 22:36:17,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:36:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 50 states and 68 transitions. [2024-11-13 22:36:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-11-13 22:36:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 22:36:17,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:36:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 52 states and 71 transitions. [2024-11-13 22:36:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-11-13 22:36:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 22:36:17,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:36:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 54 states and 73 transitions. [2024-11-13 22:36:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-13 22:36:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 22:36:18,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:18,180 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-13 22:36:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 58 states and 77 transitions. [2024-11-13 22:36:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-13 22:36:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 22:36:18,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:18,425 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-13 22:36:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 60 states and 79 transitions. [2024-11-13 22:36:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-11-13 22:36:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 22:36:18,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:18,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:18,607 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-13 22:36:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 62 states and 81 transitions. [2024-11-13 22:36:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2024-11-13 22:36:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-13 22:36:18,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:18,801 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-13 22:36:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 64 states and 83 transitions. [2024-11-13 22:36:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-13 22:36:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 22:36:18,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:19,124 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-13 22:36:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 65 states and 83 transitions. [2024-11-13 22:36:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2024-11-13 22:36:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 22:36:19,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:19,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:19,336 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-13 22:36:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 68 states and 89 transitions. [2024-11-13 22:36:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2024-11-13 22:36:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 22:36:19,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:36:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 69 states and 90 transitions. [2024-11-13 22:36:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-11-13 22:36:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 22:36:19,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:36:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 71 states and 93 transitions. [2024-11-13 22:36:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2024-11-13 22:36:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-13 22:36:20,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:36:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 73 states and 96 transitions. [2024-11-13 22:36:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-13 22:36:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 22:36:20,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:36:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 75 states and 99 transitions. [2024-11-13 22:36:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2024-11-13 22:36:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 22:36:21,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:21,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:36:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 77 states and 102 transitions. [2024-11-13 22:36:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2024-11-13 22:36:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 22:36:21,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:36:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 79 states and 105 transitions. [2024-11-13 22:36:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2024-11-13 22:36:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 22:36:22,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:22,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:36:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 81 states and 107 transitions. [2024-11-13 22:36:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2024-11-13 22:36:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 22:36:22,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-13 22:36:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 83 states and 111 transitions. [2024-11-13 22:36:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2024-11-13 22:36:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 22:36:23,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 22:36:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 87 states and 118 transitions. [2024-11-13 22:36:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2024-11-13 22:36:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 22:36:24,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 59 proven. 5 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 22:36:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 88 states and 120 transitions. [2024-11-13 22:36:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-11-13 22:36:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 22:36:25,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 35 proven. 43 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-13 22:36:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 90 states and 123 transitions. [2024-11-13 22:36:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 123 transitions. [2024-11-13 22:36:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 22:36:25,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 85 proven. 17 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 22:36:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 96 states and 132 transitions. [2024-11-13 22:36:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2024-11-13 22:36:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 22:36:27,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 60 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 22:36:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 97 states and 134 transitions. [2024-11-13 22:36:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2024-11-13 22:36:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 22:36:28,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:28,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 85 proven. 5 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 22:36:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 95 states and 127 transitions. [2024-11-13 22:36:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2024-11-13 22:36:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 22:36:28,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 96 proven. 63 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 22:36:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 97 states and 131 transitions. [2024-11-13 22:36:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2024-11-13 22:36:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 22:36:29,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:29,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 168 proven. 34 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 22:36:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 105 states and 145 transitions. [2024-11-13 22:36:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2024-11-13 22:36:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 22:36:31,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:31,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 193 proven. 41 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 22:36:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 106 states and 147 transitions. [2024-11-13 22:36:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-11-13 22:36:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 22:36:32,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 192 proven. 12 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-13 22:36:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 107 states and 148 transitions. [2024-11-13 22:36:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2024-11-13 22:36:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 22:36:33,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:33,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 191 proven. 85 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-13 22:36:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 109 states and 151 transitions. [2024-11-13 22:36:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2024-11-13 22:36:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 22:36:33,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 298 proven. 57 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-13 22:36:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 118 states and 163 transitions. [2024-11-13 22:36:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 163 transitions. [2024-11-13 22:36:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 22:36:36,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:36,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 371 proven. 27 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-13 22:36:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 119 states and 164 transitions. [2024-11-13 22:36:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 164 transitions. [2024-11-13 22:36:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 22:36:37,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:37,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 326 proven. 109 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-11-13 22:36:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 121 states and 166 transitions. [2024-11-13 22:36:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 166 transitions. [2024-11-13 22:36:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 22:36:37,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:37,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 294 proven. 244 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-13 22:36:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 131 states and 176 transitions. [2024-11-13 22:36:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 176 transitions. [2024-11-13 22:36:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 22:36:40,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:36:40,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 22:36:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:36:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:36:40,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 22:36:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:36:41,244 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 35 iterations. [2024-11-13 22:36:41,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:36:41 ImpRootNode [2024-11-13 22:36:41,358 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:36:41,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:36:41,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:36:41,358 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:36:41,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:36:16" (3/4) ... [2024-11-13 22:36:41,360 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 22:36:41,462 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:36:41,463 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:36:41,464 INFO L158 Benchmark]: Toolchain (without parser) took 25809.90ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 119.4MB in the beginning and 180.2MB in the end (delta: -60.8MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2024-11-13 22:36:41,464 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:36:41,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.75ms. Allocated memory is still 142.6MB. Free memory was 119.2MB in the beginning and 107.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:36:41,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.58ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 105.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:36:41,465 INFO L158 Benchmark]: Boogie Preprocessor took 25.15ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 104.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:36:41,465 INFO L158 Benchmark]: RCFGBuilder took 664.20ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 81.3MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:36:41,466 INFO L158 Benchmark]: CodeCheck took 24703.49ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 81.3MB in the beginning and 186.1MB in the end (delta: -104.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-11-13 22:36:41,466 INFO L158 Benchmark]: Witness Printer took 104.53ms. Allocated memory is still 268.4MB. Free memory was 186.1MB in the beginning and 180.2MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:36:41,468 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, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.6s, OverallIterations: 35, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5143 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1079 mSDsluCounter, 1641 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 2666 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7523 IncrementalHoareTripleChecker+Invalid, 10189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2666 mSolverCounterUnsat, 1617 mSDtfsCounter, 7523 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14152 GetRequests, 13690 SyntacticMatches, 182 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38681 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2280 ConstructedInterpolants, 0 QuantifiedInterpolants, 3286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 4930/5795 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={21361:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={21361:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=0, j=1] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=0, j=2] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=0, j=3] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=0, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=0, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=0, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=0, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=0, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={21361:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={21361:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=1, j=2] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=1, j=3] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=1, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=1, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=1, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=1, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=1, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={21361:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={21361:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=2, j=3] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=2, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=2, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=2, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=2, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=2, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={21361:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={21361:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=3, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=3, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=3, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=3, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=3, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={21361:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={21361:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=4, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=4, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=4, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=4, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={21361:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={21361:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=5, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=5, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=5, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={21361:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={21361:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={21361:0}, i=6, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={21361:0}, i=6, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={21361:0}, i=7] [L38] COND FALSE !(i < 7) [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.30ms. Allocated memory is still 142.6MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.75ms. Allocated memory is still 142.6MB. Free memory was 119.2MB in the beginning and 107.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.58ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 105.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.15ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 104.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 664.20ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 81.3MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 24703.49ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 81.3MB in the beginning and 186.1MB in the end (delta: -104.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 104.53ms. Allocated memory is still 268.4MB. Free memory was 186.1MB in the beginning and 180.2MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 22:36:41,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e93b4a9-79d1-44c8-9054-ff7f18a5a477/bin/ukojak-verify-EEHR8qb7sm/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