./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.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_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/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_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/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_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:42:51,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:42:51,497 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:42:51,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:42:51,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:42:51,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:42:51,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:42:51,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:42:51,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:42:51,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:42:51,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:42:51,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:42:51,532 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:42:51,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:42:51,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:42:51,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:42:51,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:42:51,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:42:51,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:42:51,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:42:51,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:42:51,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:42:51,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:42:51,534 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:42:51,534 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:42:51,535 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:42:51,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:42:51,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:42:51,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:42:51,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:42:51,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:42:51,536 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:42:51,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:42:51,536 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_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2024-11-13 20:42:51,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:42:51,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:42:51,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:42:51,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:42:51,907 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:42:51,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-13 20:42:53,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:42:54,167 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:42:54,170 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2024-11-13 20:42:54,180 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/data/a00e5756e/4d4a213be922422d95193ca80095c9e3/FLAGa940120d4 [2024-11-13 20:42:54,195 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/data/a00e5756e/4d4a213be922422d95193ca80095c9e3 [2024-11-13 20:42:54,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:42:54,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:42:54,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:42:54,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:42:54,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:42:54,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b3d60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54, skipping insertion in model container [2024-11-13 20:42:54,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:42:54,467 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_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2024-11-13 20:42:54,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:42:54,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:42:54,560 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_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2024-11-13 20:42:54,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:42:54,582 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:42:54,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54 WrapperNode [2024-11-13 20:42:54,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:42:54,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:42:54,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:42:54,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:42:54,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,644 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 222 [2024-11-13 20:42:54,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:42:54,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:42:54,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:42:54,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:42:54,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:42:54,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:42:54,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:42:54,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:42:54,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:42:54" (1/1) ... [2024-11-13 20:42:54,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:42:54,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:42:54,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:42:54,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:42:54,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:42:54,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:42:54,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:42:54,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:42:54,914 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:42:54,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:42:55,320 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-13 20:42:55,320 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:42:55,723 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:42:55,723 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:42:55,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:42:55 BoogieIcfgContainer [2024-11-13 20:42:55,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:42:55,725 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:42:55,725 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:42:55,735 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:42:55,736 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:42:55" (1/1) ... [2024-11-13 20:42:55,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:42:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 12 states and 16 transitions. [2024-11-13 20:42:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2024-11-13 20:42:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 20:42:55,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:42:55,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:42:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:42:57,221 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 20:42:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 13 states and 18 transitions. [2024-11-13 20:42:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2024-11-13 20:42:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:42:57,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:42:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:42:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:42:58,202 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 20:42:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 17 states and 25 transitions. [2024-11-13 20:42:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2024-11-13 20:42:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:42:58,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:42:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:42:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:42:58,897 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 20:42:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 20 states and 30 transitions. [2024-11-13 20:42:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2024-11-13 20:42:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:42:59,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:42:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:42:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:42:59,559 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 20:42:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 23 states and 36 transitions. [2024-11-13 20:42:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 36 transitions. [2024-11-13 20:42:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:42:59,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:42:59,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2024-11-13 20:43:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2024-11-13 20:43:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:43:06,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 70 transitions. [2024-11-13 20:43:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 70 transitions. [2024-11-13 20:43:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:43:14,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:14,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 50 states and 85 transitions. [2024-11-13 20:43:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2024-11-13 20:43:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:43:16,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 67 states and 124 transitions. [2024-11-13 20:43:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 124 transitions. [2024-11-13 20:43:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:43:24,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:24,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 69 states and 127 transitions. [2024-11-13 20:43:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 127 transitions. [2024-11-13 20:43:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:43:25,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:25,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 88 states and 166 transitions. [2024-11-13 20:43:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 166 transitions. [2024-11-13 20:43:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:43:34,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:34,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 96 states and 189 transitions. [2024-11-13 20:43:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 189 transitions. [2024-11-13 20:43:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:43:41,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:41,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 102 states and 202 transitions. [2024-11-13 20:43:45,550 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 202 transitions. [2024-11-13 20:43:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:43:45,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 104 states and 214 transitions. [2024-11-13 20:43:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 214 transitions. [2024-11-13 20:43:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 20:43:46,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:46,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 112 states and 216 transitions. [2024-11-13 20:43:52,786 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 216 transitions. [2024-11-13 20:43:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 20:43:52,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:52,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:44:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 137 states and 290 transitions. [2024-11-13 20:44:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 290 transitions. [2024-11-13 20:44:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 20:44:28,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:28,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:44:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 147 states and 308 transitions. [2024-11-13 20:44:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 308 transitions. [2024-11-13 20:44:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 20:44:34,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:45:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 171 states and 366 transitions. [2024-11-13 20:45:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 366 transitions. [2024-11-13 20:45:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 20:45:23,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:45:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 176 states and 373 transitions. [2024-11-13 20:45:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 373 transitions. [2024-11-13 20:45:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 20:45:30,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:45:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 185 states and 403 transitions. [2024-11-13 20:45:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 403 transitions. [2024-11-13 20:45:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 20:45:40,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:46:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:46:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 210 states and 464 transitions. [2024-11-13 20:46:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 464 transitions. [2024-11-13 20:46:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 20:46:42,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:46:42,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:46:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:46:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:46:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:46:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 216 states and 480 transitions. [2024-11-13 20:46:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 480 transitions. [2024-11-13 20:46:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 20:46:51,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:46:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:46:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:46:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:47:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:47:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 230 states and 541 transitions. [2024-11-13 20:47:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 541 transitions. [2024-11-13 20:47:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 20:47:11,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:47:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:47:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:47:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:47:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:47:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 236 states and 557 transitions. [2024-11-13 20:47:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 557 transitions. [2024-11-13 20:47:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 20:47:17,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:47:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:47:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:47:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:47:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:47:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 250 states and 626 transitions. [2024-11-13 20:47:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 626 transitions. [2024-11-13 20:47:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 20:47:42,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:47:42,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:47:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:47:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 266 states and 692 transitions. [2024-11-13 20:48:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 692 transitions. [2024-11-13 20:48:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 20:48:15,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:15,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 26 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 274 states and 740 transitions. [2024-11-13 20:48:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 740 transitions. [2024-11-13 20:48:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:48:31,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:31,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 282 states and 767 transitions. [2024-11-13 20:48:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 767 transitions. [2024-11-13 20:48:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:48:42,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:42,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:48:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 288 states and 792 transitions. [2024-11-13 20:48:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 792 transitions. [2024-11-13 20:48:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:48:53,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:53,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 296 states and 819 transitions. [2024-11-13 20:49:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 819 transitions. [2024-11-13 20:49:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:49:13,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 308 states and 839 transitions. [2024-11-13 20:49:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 839 transitions. [2024-11-13 20:49:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:49:30,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 315 states and 865 transitions. [2024-11-13 20:49:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 865 transitions. [2024-11-13 20:49:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:49:41,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:49:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 321 states and 875 transitions. [2024-11-13 20:49:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 875 transitions. [2024-11-13 20:49:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:49:53,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:50:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 329 states and 900 transitions. [2024-11-13 20:50:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 900 transitions. [2024-11-13 20:50:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:50:05,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:50:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 335 states and 916 transitions. [2024-11-13 20:50:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 916 transitions. [2024-11-13 20:50:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:50:21,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:50:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 341 states and 955 transitions. [2024-11-13 20:50:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 955 transitions. [2024-11-13 20:50:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:50:33,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:33,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:50:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 348 states and 965 transitions. [2024-11-13 20:50:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 965 transitions. [2024-11-13 20:50:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:50:44,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:51:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 360 states and 1003 transitions. [2024-11-13 20:51:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 1003 transitions. [2024-11-13 20:51:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:51:04,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:04,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:51:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 371 states and 1027 transitions. [2024-11-13 20:51:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1027 transitions. [2024-11-13 20:51:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:51:30,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:51:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 372 states and 1028 transitions. [2024-11-13 20:51:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1028 transitions. [2024-11-13 20:51:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:51:33,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:51:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 373 states and 1029 transitions. [2024-11-13 20:51:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1029 transitions. [2024-11-13 20:51:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:51:39,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:39,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:51:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 381 states and 1078 transitions. [2024-11-13 20:51:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1078 transitions. [2024-11-13 20:51:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:51:56,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:56,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:52:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 392 states and 1091 transitions. [2024-11-13 20:52:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1091 transitions. [2024-11-13 20:52:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:52:13,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:13,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:52:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:52:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 393 states and 1089 transitions. [2024-11-13 20:52:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1089 transitions. [2024-11-13 20:52:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 20:52:17,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:52:17,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:52:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:52:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:52:18,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:52:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:52:18,506 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 44 iterations. [2024-11-13 20:52:18,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:52:18 ImpRootNode [2024-11-13 20:52:18,625 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:52:18,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:52:18,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:52:18,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:52:18,626 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:42:55" (3/4) ... [2024-11-13 20:52:18,627 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 20:52:18,715 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:52:18,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:52:18,716 INFO L158 Benchmark]: Toolchain (without parser) took 564516.49ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 92.0MB in the beginning and 991.7MB in the end (delta: -899.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-13 20:52:18,716 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:52:18,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.82ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.5MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:52:18,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.39ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:52:18,717 INFO L158 Benchmark]: Boogie Preprocessor took 48.95ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 75.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:52:18,718 INFO L158 Benchmark]: RCFGBuilder took 1028.87ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 70.5MB in the end (delta: 4.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-13 20:52:18,718 INFO L158 Benchmark]: CodeCheck took 562900.24ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 70.5MB in the beginning and 1.0GB in the end (delta: -935.4MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-13 20:52:18,718 INFO L158 Benchmark]: Witness Printer took 89.92ms. Allocated memory is still 2.4GB. Free memory was 1.0GB in the beginning and 991.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:52:18,725 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 562.7s, OverallIterations: 44, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17085 SdHoareTripleChecker+Valid, 174.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16206 mSDsluCounter, 12424 SdHoareTripleChecker+Invalid, 157.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12084 mSDsCounter, 9450 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61900 IncrementalHoareTripleChecker+Invalid, 71350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9450 mSolverCounterUnsat, 340 mSDtfsCounter, 61900 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17412 GetRequests, 15283 SyntacticMatches, 839 SemanticMatches, 1290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059192 ImplicationChecksByTransitivity, 485.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 108.9s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1293 ConstructedInterpolants, 0 QuantifiedInterpolants, 28539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 4 PerfectInterpolantSequences, 518/1986 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: 287]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] port_t p2 ; [L38] char p2_old ; [L39] char p2_new ; [L40] char id2 ; [L41] char st2 ; [L42] msg_t send2 ; [L43] _Bool mode2 ; [L44] port_t p3 ; [L45] char p3_old ; [L46] char p3_new ; [L47] char id3 ; [L48] char st3 ; [L49] msg_t send3 ; [L50] _Bool mode3 ; [L235] int c1 ; [L236] int i2 ; [L239] c1 = 0 [L240] r1 = __VERIFIER_nondet_uchar() [L241] id1 = __VERIFIER_nondet_char() [L242] st1 = __VERIFIER_nondet_char() [L243] send1 = __VERIFIER_nondet_char() [L244] mode1 = __VERIFIER_nondet_bool() [L245] id2 = __VERIFIER_nondet_char() [L246] st2 = __VERIFIER_nondet_char() [L247] send2 = __VERIFIER_nondet_char() [L248] mode2 = __VERIFIER_nondet_bool() [L249] id3 = __VERIFIER_nondet_char() [L250] st3 = __VERIFIER_nondet_char() [L251] send3 = __VERIFIER_nondet_char() [L252] mode3 = __VERIFIER_nondet_bool() [L253] CALL, EXPR init() [L134] int tmp ; [L137] COND TRUE (int )r1 == 0 [L138] COND TRUE (int )id1 >= 0 [L139] COND TRUE (int )st1 == 0 [L140] COND TRUE (int )send1 == (int )id1 [L141] COND TRUE (int )mode1 == 0 [L142] COND TRUE (int )id2 >= 0 [L143] COND TRUE (int )st2 == 0 [L144] COND TRUE (int )send2 == (int )id2 [L145] COND TRUE (int )mode2 == 0 [L146] COND TRUE (int )id3 >= 0 [L147] COND TRUE (int )st3 == 0 [L148] COND TRUE (int )send3 == (int )id3 [L149] COND TRUE (int )mode3 == 0 [L150] COND TRUE (int )id1 != (int )id2 [L151] COND TRUE (int )id1 != (int )id3 [L152] COND TRUE (int )id2 != (int )id3 [L153] tmp = 1 [L202] return (tmp); [L253] RET, EXPR init() [L253] i2 = init() [L254] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L254] RET assume_abort_if_not(i2) [L255] p1_old = nomsg [L256] p1_new = nomsg [L257] p2_old = nomsg [L258] p2_new = nomsg [L259] p3_old = nomsg [L260] p3_new = nomsg [L261] i2 = 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=256, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=256, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=256, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=256, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=256, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=256, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=256, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND FALSE !((int )m3 > (int )id3) [L120] COND FALSE !((int )m3 == (int )id3) [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND TRUE (int )m1 == (int )id1 [L69] st1 = (char)1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND FALSE !((int )m3 > (int )id3) [L120] COND TRUE (int )m3 == (int )id3 [L121] st3 = (char)1 [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L210] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L228] tmp = 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1, tmp=0] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND TRUE ! arg VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L287] reach_error() VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.82ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.5MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.39ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.95ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 75.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1028.87ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 70.5MB in the end (delta: 4.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * CodeCheck took 562900.24ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 70.5MB in the beginning and 1.0GB in the end (delta: -935.4MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 89.92ms. Allocated memory is still 2.4GB. Free memory was 1.0GB in the beginning and 991.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 20:52:18,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b6c3f4-bf4b-41aa-9dff-b061feaf763a/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE