./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.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_622bdf25-979e-40e7-a7c6-bb4d17e64335/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/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_622bdf25-979e-40e7-a7c6-bb4d17e64335/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/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_622bdf25-979e-40e7-a7c6-bb4d17e64335/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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:17:24,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:17:24,920 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:17:24,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:17:24,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:17:24,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:17:24,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:17:24,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:17:24,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:17:24,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:17:24,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:17:24,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:17:24,967 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:17:24,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:17:24,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:17:24,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:17:24,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:17:24,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:17:24,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:17:24,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:17:24,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:17:24,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:17:24,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:17:24,969 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:17:24,969 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:17:24,969 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:17:24,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:17:24,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:17:24,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:17:24,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:17:24,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:17:24,969 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:17:24,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:17:24,970 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_622bdf25-979e-40e7-a7c6-bb4d17e64335/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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2024-11-13 20:17:25,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:17:25,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:17:25,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:17:25,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:17:25,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:17:25,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-13 20:17:27,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:17:27,743 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:17:27,744 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-11-13 20:17:27,760 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/bin/ukojak-verify-EEHR8qb7sm/data/52fc1fdc9/901a2423d75d4390b98544e2f20ca33d/FLAG34837cbc4 [2024-11-13 20:17:27,919 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/bin/ukojak-verify-EEHR8qb7sm/data/52fc1fdc9/901a2423d75d4390b98544e2f20ca33d [2024-11-13 20:17:27,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:17:27,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:17:27,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:17:27,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:17:27,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:17:27,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:17:27" (1/1) ... [2024-11-13 20:17:27,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583dd712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:27, skipping insertion in model container [2024-11-13 20:17:27,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:17:27" (1/1) ... [2024-11-13 20:17:27,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:17:28,282 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_622bdf25-979e-40e7-a7c6-bb4d17e64335/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-11-13 20:17:28,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:17:28,308 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:17:28,401 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_622bdf25-979e-40e7-a7c6-bb4d17e64335/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-11-13 20:17:28,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:17:28,424 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:17:28,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28 WrapperNode [2024-11-13 20:17:28,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:17:28,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:17:28,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:17:28,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:17:28,433 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:17:28" (1/1) ... [2024-11-13 20:17:28,442 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:17:28" (1/1) ... [2024-11-13 20:17:28,487 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 441 [2024-11-13 20:17:28,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:17:28,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:17:28,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:17:28,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:17:28,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:17:28,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:17:28,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:17:28,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:17:28,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:17:28,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:17:28,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/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:17:28,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/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:17:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:17:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:17:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:17:28,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:17:28,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:17:28,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:17:29,585 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-13 20:17:29,586 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:17:30,498 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:17:30,498 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:17:30,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:17:30 BoogieIcfgContainer [2024-11-13 20:17:30,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:17:30,499 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:17:30,500 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:17:30,511 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:17:30,511 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:17:30" (1/1) ... [2024-11-13 20:17:30,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:17:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 20:17:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 20:17:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 20:17:30,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:33,164 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:17:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-13 20:17:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-13 20:17:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:17:33,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:34,451 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:17:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-13 20:17:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-13 20:17:34,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:17:34,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:34,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:35,852 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:17:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-13 20:17:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-13 20:17:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:17:36,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:36,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:37,309 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:17:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-13 20:17:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-13 20:17:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:17:38,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:39,259 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:17:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-13 20:17:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-13 20:17:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:17:40,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:41,500 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:17:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-13 20:17:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-13 20:17:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 20:17:42,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:43,103 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:17:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-13 20:17:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-13 20:17:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:17:43,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:43,663 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:17:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-11-13 20:17:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-11-13 20:17:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:17:43,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:43,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:44,929 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:17:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-11-13 20:17:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-11-13 20:17:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:17:47,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:47,487 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:17:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-11-13 20:17:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-11-13 20:17:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:17:48,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:48,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:50,893 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:17:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 76 states and 130 transitions. [2024-11-13 20:17:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2024-11-13 20:17:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:17:54,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 89 states and 155 transitions. [2024-11-13 20:17:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 155 transitions. [2024-11-13 20:17:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:17:57,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:59,555 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:18:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 103 states and 184 transitions. [2024-11-13 20:18:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 184 transitions. [2024-11-13 20:18:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:18:02,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:04,107 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:18:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 105 states and 195 transitions. [2024-11-13 20:18:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 195 transitions. [2024-11-13 20:18:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:18:05,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 114 states and 215 transitions. [2024-11-13 20:18:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 215 transitions. [2024-11-13 20:18:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:18:09,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 117 states and 225 transitions. [2024-11-13 20:18:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 225 transitions. [2024-11-13 20:18:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:18:11,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 118 states and 229 transitions. [2024-11-13 20:18:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 229 transitions. [2024-11-13 20:18:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:18:13,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 119 states and 231 transitions. [2024-11-13 20:18:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 231 transitions. [2024-11-13 20:18:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 20:18:14,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:14,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 139 states and 263 transitions. [2024-11-13 20:18:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 263 transitions. [2024-11-13 20:18:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 20:18:22,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 144 states and 276 transitions. [2024-11-13 20:18:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 276 transitions. [2024-11-13 20:18:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 20:18:25,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 152 states and 294 transitions. [2024-11-13 20:18:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 294 transitions. [2024-11-13 20:18:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 20:18:32,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 167 states and 342 transitions. [2024-11-13 20:18:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 342 transitions. [2024-11-13 20:18:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:18:43,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:43,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 178 states and 363 transitions. [2024-11-13 20:18:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 363 transitions. [2024-11-13 20:18:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:18:51,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 179 states and 366 transitions. [2024-11-13 20:18:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 366 transitions. [2024-11-13 20:18:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 20:18:54,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 191 states and 395 transitions. [2024-11-13 20:19:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 395 transitions. [2024-11-13 20:19:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 20:19:07,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 193 states and 402 transitions. [2024-11-13 20:19:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 402 transitions. [2024-11-13 20:19:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 20:19:11,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 194 states and 405 transitions. [2024-11-13 20:19:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2024-11-13 20:19:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 20:19:15,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 200 states and 420 transitions. [2024-11-13 20:19:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 420 transitions. [2024-11-13 20:19:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 20:19:24,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 214 states and 447 transitions. [2024-11-13 20:19:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 447 transitions. [2024-11-13 20:19:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 20:19:31,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 216 states and 453 transitions. [2024-11-13 20:19:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 453 transitions. [2024-11-13 20:19:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 20:19:35,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 218 states and 458 transitions. [2024-11-13 20:19:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 458 transitions. [2024-11-13 20:19:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 20:19:42,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 224 states and 481 transitions. [2024-11-13 20:19:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 481 transitions. [2024-11-13 20:19:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 20:19:50,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:20:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 229 states and 503 transitions. [2024-11-13 20:20:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 503 transitions. [2024-11-13 20:20:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 20:20:01,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:20:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 230 states and 506 transitions. [2024-11-13 20:20:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 506 transitions. [2024-11-13 20:20:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:20:03,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:20:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 236 states and 529 transitions. [2024-11-13 20:20:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 529 transitions. [2024-11-13 20:20:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:20:12,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:12,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:20:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 245 states and 545 transitions. [2024-11-13 20:20:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 545 transitions. [2024-11-13 20:20:21,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:20:21,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:20:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 247 states and 550 transitions. [2024-11-13 20:20:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 550 transitions. [2024-11-13 20:20:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:20:24,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:24,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:20:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 248 states and 551 transitions. [2024-11-13 20:20:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 551 transitions. [2024-11-13 20:20:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:20:26,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:20:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 249 states and 554 transitions. [2024-11-13 20:20:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 554 transitions. [2024-11-13 20:20:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 20:20:29,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:20:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 259 states and 574 transitions. [2024-11-13 20:20:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 574 transitions. [2024-11-13 20:20:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 20:20:41,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:41,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:20:42,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:20:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:20:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:20:43,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:20:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:20:43,845 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 41 iterations. [2024-11-13 20:20:43,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:20:43 ImpRootNode [2024-11-13 20:20:43,980 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:20:43,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:20:43,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:20:43,981 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:20:43,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:17:30" (3/4) ... [2024-11-13 20:20:43,982 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 20:20:44,117 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:20:44,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:20:44,118 INFO L158 Benchmark]: Toolchain (without parser) took 196195.71ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 91.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 747.1MB. Max. memory is 16.1GB. [2024-11-13 20:20:44,119 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:20:44,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.91ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:20:44,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.57ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 72.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:20:44,120 INFO L158 Benchmark]: Boogie Preprocessor took 42.79ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:20:44,120 INFO L158 Benchmark]: RCFGBuilder took 1967.71ms. Allocated memory was 117.4MB in the beginning and 335.5MB in the end (delta: 218.1MB). Free memory was 70.1MB in the beginning and 229.2MB in the end (delta: -159.1MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-11-13 20:20:44,120 INFO L158 Benchmark]: CodeCheck took 193480.27ms. Allocated memory was 335.5MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 229.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 648.1MB. Max. memory is 16.1GB. [2024-11-13 20:20:44,121 INFO L158 Benchmark]: Witness Printer took 137.15ms. Allocated memory is still 2.4GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:20:44,123 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 193.3s, OverallIterations: 41, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12017 SdHoareTripleChecker+Valid, 89.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10690 mSDsluCounter, 3919 SdHoareTripleChecker+Invalid, 80.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3277 mSDsCounter, 4718 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34301 IncrementalHoareTripleChecker+Invalid, 39019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4718 mSolverCounterUnsat, 642 mSDtfsCounter, 34301 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10990 GetRequests, 9497 SyntacticMatches, 611 SemanticMatches, 882 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532649 ImplicationChecksByTransitivity, 134.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 67.6s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1044 ConstructedInterpolants, 0 QuantifiedInterpolants, 10296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 119/633 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: 543]: 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] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L465] int c1 ; [L466] int i2 ; [L469] c1 = 0 [L470] ep12 = __VERIFIER_nondet_bool() [L471] ep13 = __VERIFIER_nondet_bool() [L472] ep21 = __VERIFIER_nondet_bool() [L473] ep23 = __VERIFIER_nondet_bool() [L474] ep31 = __VERIFIER_nondet_bool() [L475] ep32 = __VERIFIER_nondet_bool() [L476] id1 = __VERIFIER_nondet_char() [L477] r1 = __VERIFIER_nondet_uchar() [L478] st1 = __VERIFIER_nondet_char() [L479] nl1 = __VERIFIER_nondet_char() [L480] m1 = __VERIFIER_nondet_char() [L481] max1 = __VERIFIER_nondet_char() [L482] mode1 = __VERIFIER_nondet_bool() [L483] id2 = __VERIFIER_nondet_char() [L484] r2 = __VERIFIER_nondet_uchar() [L485] st2 = __VERIFIER_nondet_char() [L486] nl2 = __VERIFIER_nondet_char() [L487] m2 = __VERIFIER_nondet_char() [L488] max2 = __VERIFIER_nondet_char() [L489] mode2 = __VERIFIER_nondet_bool() [L490] id3 = __VERIFIER_nondet_char() [L491] r3 = __VERIFIER_nondet_uchar() [L492] st3 = __VERIFIER_nondet_char() [L493] nl3 = __VERIFIER_nondet_char() [L494] m3 = __VERIFIER_nondet_char() [L495] max3 = __VERIFIER_nondet_char() [L496] mode3 = __VERIFIER_nondet_bool() [L497] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND TRUE \read(r121) [L242] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND TRUE \read(r121) [L258] COND FALSE !(\read(ep23)) [L261] tmp___0 = 0 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND FALSE !(\read(r231)) [L277] tmp___1 = 0 [L279] r212 = (_Bool )tmp___1 [L280] COND FALSE !(\read(r231)) [L283] COND FALSE !(\read(r211)) [L290] tmp___2 = 0 [L292] r232 = (_Bool )tmp___2 [L293] COND FALSE !(\read(r311)) [L296] COND FALSE !(\read(r321)) [L303] tmp___3 = 0 [L305] r312 = (_Bool )tmp___3 [L306] COND FALSE !(\read(r321)) [L309] COND FALSE !(\read(r311)) [L316] tmp___4 = 0 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE (int )max1 == (int )id1 [L329] COND TRUE (int )max2 == (int )id2 [L330] COND TRUE (int )max3 == (int )id3 [L331] COND TRUE (int )st1 == 0 [L332] COND TRUE (int )st2 == 0 [L333] COND TRUE (int )st3 == 0 [L334] COND TRUE (int )nl1 == 0 [L335] COND TRUE (int )nl2 == 0 [L336] COND TRUE (int )nl3 == 0 [L337] COND TRUE (int )mode1 == 0 [L338] COND TRUE (int )mode2 == 0 [L339] COND TRUE (int )mode3 == 0 [L340] tmp___5 = 1 [L404] return (tmp___5); [L497] RET, EXPR init() [L497] i2 = init() [L498] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L498] RET assume_abort_if_not(i2) [L499] p12_old = nomsg [L500] p12_new = nomsg [L501] p13_old = nomsg [L502] p13_new = nomsg [L503] p21_old = nomsg [L504] p21_new = nomsg [L505] p23_old = nomsg [L506] p23_new = nomsg [L507] p31_old = nomsg [L508] p31_new = nomsg [L509] p32_old = nomsg [L510] p32_new = nomsg [L511] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND TRUE 1 [L514] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L514] RET node1() [L515] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L515] RET node2() [L516] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L530] RET assert(c1) [L512] COND TRUE 1 [L514] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L514] RET node1() [L515] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND TRUE (int )m2 > (int )max2 [L134] max2 = m2 [L137] COND FALSE !(\read(ep32)) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L515] RET node2() [L516] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L530] RET assert(c1) [L512] COND TRUE 1 [L514] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L514] RET node1() [L515] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L515] RET node2() [L516] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L530] RET assert(c1) [L512] COND TRUE 1 [L514] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L514] RET node1() [L515] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND FALSE !(\read(ep32)) [L144] COND TRUE (int )r2 == 2 [L145] COND FALSE !((int )max2 == (int )id2) [L148] nl2 = (char)1 [L151] mode2 = (_Bool)0 [L515] RET node2() [L516] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L412] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L458] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L543] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=1, id3=0, m1=3, m2=2, m3=1, max1=2, max2=2, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.91ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.57ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 72.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.79ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1967.71ms. Allocated memory was 117.4MB in the beginning and 335.5MB in the end (delta: 218.1MB). Free memory was 70.1MB in the beginning and 229.2MB in the end (delta: -159.1MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * CodeCheck took 193480.27ms. Allocated memory was 335.5MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 229.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 648.1MB. Max. memory is 16.1GB. * Witness Printer took 137.15ms. Allocated memory is still 2.4GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 20:20:44,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622bdf25-979e-40e7-a7c6-bb4d17e64335/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