./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:44:31,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:44:32,069 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:44:32,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:44:32,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:44:32,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:44:32,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:44:32,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:44:32,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:44:32,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:44:32,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:44:32,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:44:32,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:44:32,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:44:32,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:44:32,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:44:32,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:44:32,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:44:32,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:44:32,124 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:44:32,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:44:32,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:44:32,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:44:32,125 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:44:32,126 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:44:32,126 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:44:32,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:44:32,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:44:32,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:44:32,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:44:32,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:44:32,128 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:44:32,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:44:32,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a [2024-11-08 23:44:32,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:44:32,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:44:32,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:44:32,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:44:32,458 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:44:32,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-08 23:44:34,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:44:34,757 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:44:34,758 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-11-08 23:44:34,775 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/data/c733a138d/c78ff9f2215d474d8b07a07beaa6ebec/FLAGc1c0fe5b2 [2024-11-08 23:44:35,079 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/data/c733a138d/c78ff9f2215d474d8b07a07beaa6ebec [2024-11-08 23:44:35,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:44:35,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:44:35,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:44:35,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:44:35,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:44:35,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b179d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35, skipping insertion in model container [2024-11-08 23:44:35,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:44:35,431 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_073f3618-239c-49a3-93f2-bbda7c9daf71/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2024-11-08 23:44:35,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:44:35,448 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:44:35,524 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_073f3618-239c-49a3-93f2-bbda7c9daf71/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2024-11-08 23:44:35,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:44:35,545 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:44:35,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35 WrapperNode [2024-11-08 23:44:35,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:44:35,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:44:35,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:44:35,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:44:35,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,609 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 453 [2024-11-08 23:44:35,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:44:35,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:44:35,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:44:35,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:44:35,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:44:35,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:44:35,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:44:35,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:44:35,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:35" (1/1) ... [2024-11-08 23:44:35,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:44:35,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:44:35,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:44:35,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:44:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:44:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:44:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:44:35,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:44:35,889 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:44:35,892 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:44:36,613 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-08 23:44:36,613 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:44:37,386 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:44:37,386 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:44:37,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:44:37 BoogieIcfgContainer [2024-11-08 23:44:37,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:44:37,387 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:44:37,388 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:44:37,398 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:44:37,398 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:44:37" (1/1) ... [2024-11-08 23:44:37,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:44:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-08 23:44:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-08 23:44:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:37,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:40,360 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-08 23:44:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-08 23:44:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-08 23:44:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:44:40,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:41,861 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-08 23:44:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-08 23:44:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-08 23:44:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:44:42,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:43,375 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-08 23:44:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-08 23:44:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-08 23:44:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:44:43,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:45,090 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-08 23:44:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-08 23:44:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-08 23:44:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:44:45,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:47,452 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-08 23:44:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-08 23:44:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-08 23:44:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:44:48,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:49,643 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-08 23:44:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-08 23:44:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-08 23:44:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:44:50,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:50,940 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-08 23:44:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-08 23:44:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-08 23:44:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:44:51,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:51,435 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-08 23:44:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-11-08 23:44:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-11-08 23:44:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:44:51,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:52,992 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-08 23:44:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-11-08 23:44:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-11-08 23:44:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:44:55,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:55,411 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-08 23:44:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-11-08 23:44:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-11-08 23:44:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 23:44:55,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:55,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:59,269 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-08 23:45:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 76 states and 134 transitions. [2024-11-08 23:45:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-11-08 23:45:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:45:03,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:05,493 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-08 23:45:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 90 states and 158 transitions. [2024-11-08 23:45:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 158 transitions. [2024-11-08 23:45:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:45:08,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:08,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:10,797 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-08 23:45:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 98 states and 183 transitions. [2024-11-08 23:45:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 183 transitions. [2024-11-08 23:45:13,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:45:13,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,342 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-08 23:45:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 100 states and 194 transitions. [2024-11-08 23:45:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 194 transitions. [2024-11-08 23:45:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:45:16,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:18,103 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-08 23:45:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 114 states and 223 transitions. [2024-11-08 23:45:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 223 transitions. [2024-11-08 23:45:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:45:21,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:23,803 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-08 23:45:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 120 states and 247 transitions. [2024-11-08 23:45:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 247 transitions. [2024-11-08 23:45:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:45:27,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:28,562 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-08 23:45:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 123 states and 256 transitions. [2024-11-08 23:45:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 256 transitions. [2024-11-08 23:45:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:45:30,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:31,142 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-08 23:45:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 124 states and 258 transitions. [2024-11-08 23:45:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 258 transitions. [2024-11-08 23:45:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:45:31,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:34,629 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-08 23:45:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 144 states and 291 transitions. [2024-11-08 23:45:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 291 transitions. [2024-11-08 23:45:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:45:41,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:41,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:42,449 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-08 23:45:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 149 states and 303 transitions. [2024-11-08 23:45:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 303 transitions. [2024-11-08 23:45:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 23:45:44,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:47,813 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-08 23:45:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 161 states and 328 transitions. [2024-11-08 23:45:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 328 transitions. [2024-11-08 23:45:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:45:53,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 159 states and 317 transitions. [2024-11-08 23:45:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 317 transitions. [2024-11-08 23:45:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 23:45:56,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:59,963 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-08 23:46:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:46:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 174 states and 369 transitions. [2024-11-08 23:46:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 369 transitions. [2024-11-08 23:46:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 23:46:08,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:46:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:11,648 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-08 23:46:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:46:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 183 states and 405 transitions. [2024-11-08 23:46:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 405 transitions. [2024-11-08 23:46:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:46:18,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:46:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:46:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:46:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 194 states and 429 transitions. [2024-11-08 23:46:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 429 transitions. [2024-11-08 23:46:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:46:28,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:46:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:33,219 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-08 23:46:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:46:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 207 states and 454 transitions. [2024-11-08 23:46:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 454 transitions. [2024-11-08 23:46:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:46:46,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:46:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:49,451 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-08 23:46:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:46:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 216 states and 487 transitions. [2024-11-08 23:46:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 487 transitions. [2024-11-08 23:46:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:46:55,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:46:55,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:58,938 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-08 23:47:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:47:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 217 states and 502 transitions. [2024-11-08 23:47:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 502 transitions. [2024-11-08 23:47:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:47:00,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:47:00,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:47:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:47:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 218 states and 505 transitions. [2024-11-08 23:47:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 505 transitions. [2024-11-08 23:47:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:47:02,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:47:02,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:04,889 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-08 23:47:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:47:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 230 states and 531 transitions. [2024-11-08 23:47:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 531 transitions. [2024-11-08 23:47:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:47:15,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:47:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:18,591 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-08 23:47:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:47:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 236 states and 541 transitions. [2024-11-08 23:47:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 541 transitions. [2024-11-08 23:47:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:47:25,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:47:25,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:28,460 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-08 23:47:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:47:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 237 states and 545 transitions. [2024-11-08 23:47:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 545 transitions. [2024-11-08 23:47:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:47:30,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:47:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:35,628 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-08 23:47:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:47:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 243 states and 558 transitions. [2024-11-08 23:47:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 558 transitions. [2024-11-08 23:47:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:47:43,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:47:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:45,747 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-08 23:47:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:47:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 258 states and 599 transitions. [2024-11-08 23:47:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 599 transitions. [2024-11-08 23:47:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:47:55,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:47:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:58,102 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-08 23:48:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:48:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 267 states and 633 transitions. [2024-11-08 23:48:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 633 transitions. [2024-11-08 23:48:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:48:09,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:48:09,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:48:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:48:11,487 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-08 23:48:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:48:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 273 states and 658 transitions. [2024-11-08 23:48:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 658 transitions. [2024-11-08 23:48:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:48:19,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:48:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:48:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:48:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:48:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:48:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 282 states and 675 transitions. [2024-11-08 23:48:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 675 transitions. [2024-11-08 23:48:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:48:28,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:48:28,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:48:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:48:30,216 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-08 23:48:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:48:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 288 states and 705 transitions. [2024-11-08 23:48:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 705 transitions. [2024-11-08 23:48:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:48:39,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:48:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:48:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:48:44,257 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-08 23:48:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:48:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 289 states and 706 transitions. [2024-11-08 23:48:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 706 transitions. [2024-11-08 23:48:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:48:47,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:48:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:48:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:48:50,791 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-08 23:48:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:48:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 295 states and 732 transitions. [2024-11-08 23:48:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 732 transitions. [2024-11-08 23:48:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 23:48:58,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:48:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:48:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:48:59,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:49:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:49:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:49:00,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:49:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:49:01,017 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 41 iterations. [2024-11-08 23:49:01,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:49:01 ImpRootNode [2024-11-08 23:49:01,183 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:49:01,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:49:01,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:49:01,184 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:49:01,184 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:44:37" (3/4) ... [2024-11-08 23:49:01,185 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:49:01,373 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:49:01,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:49:01,374 INFO L158 Benchmark]: Toolchain (without parser) took 266290.63ms. Allocated memory was 138.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 106.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 921.4MB. Max. memory is 16.1GB. [2024-11-08 23:49:01,374 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 104.9MB. Free memory was 74.2MB in the beginning and 74.2MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:49:01,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.05ms. Allocated memory is still 138.4MB. Free memory was 105.8MB in the beginning and 87.1MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:49:01,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.67ms. Allocated memory is still 138.4MB. Free memory was 86.5MB in the beginning and 83.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:49:01,375 INFO L158 Benchmark]: Boogie Preprocessor took 42.63ms. Allocated memory is still 138.4MB. Free memory was 83.5MB in the beginning and 80.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:49:01,376 INFO L158 Benchmark]: RCFGBuilder took 1732.77ms. Allocated memory is still 138.4MB. Free memory was 80.8MB in the beginning and 67.2MB in the end (delta: 13.6MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2024-11-08 23:49:01,376 INFO L158 Benchmark]: CodeCheck took 263795.40ms. Allocated memory was 138.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 67.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 863.6MB. Max. memory is 16.1GB. [2024-11-08 23:49:01,376 INFO L158 Benchmark]: Witness Printer took 189.71ms. Allocated memory is still 2.2GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:49:01,378 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: 263.6s, OverallIterations: 41, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12934 SdHoareTripleChecker+Valid, 99.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11607 mSDsluCounter, 4869 SdHoareTripleChecker+Invalid, 89.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4227 mSDsCounter, 5276 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38952 IncrementalHoareTripleChecker+Invalid, 44228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5276 mSolverCounterUnsat, 642 mSDtfsCounter, 38952 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10856 GetRequests, 9266 SyntacticMatches, 542 SemanticMatches, 1048 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695704 ImplicationChecksByTransitivity, 187.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 86.6s InterpolantComputationTime, 1111 NumberOfCodeBlocks, 1111 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1023 ConstructedInterpolants, 0 QuantifiedInterpolants, 10875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 108/598 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: 567]: 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 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] 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 TRUE \read(ep23) [L259] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND TRUE \read(r211) [L268] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND TRUE \read(r231) [L281] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND TRUE \read(r321) [L307] tmp___4 = 1 [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 \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, 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] [L536] COND TRUE 1 [L538] 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 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=125, m3=-2, max1=124, max2=127, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] 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 TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND TRUE (int )m3 > (int )max3 [L187] max3 = m3 [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, 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] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] 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 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=126, m2=126, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] st1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] 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 TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND TRUE (int )r3 == 2 [L191] COND FALSE !((int )max3 == (int )id3) [L194] nl3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] [L567] reach_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=124, id2=127, id3=126, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 104.9MB. Free memory was 74.2MB in the beginning and 74.2MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.05ms. Allocated memory is still 138.4MB. Free memory was 105.8MB in the beginning and 87.1MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.67ms. Allocated memory is still 138.4MB. Free memory was 86.5MB in the beginning and 83.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.63ms. Allocated memory is still 138.4MB. Free memory was 83.5MB in the beginning and 80.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1732.77ms. Allocated memory is still 138.4MB. Free memory was 80.8MB in the beginning and 67.2MB in the end (delta: 13.6MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * CodeCheck took 263795.40ms. Allocated memory was 138.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 67.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 863.6MB. Max. memory is 16.1GB. * Witness Printer took 189.71ms. Allocated memory is still 2.2GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:49:01,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073f3618-239c-49a3-93f2-bbda7c9daf71/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE