./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --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 a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 19:01:00,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 19:01:00,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 19:01:00,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 19:01:00,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 19:01:00,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 19:01:00,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 19:01:00,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 19:01:00,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 19:01:00,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 19:01:00,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 19:01:00,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 19:01:00,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 19:01:00,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 19:01:00,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 19:01:00,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 19:01:00,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 19:01:00,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 19:01:00,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 19:01:00,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 19:01:00,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 19:01:00,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 19:01:00,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 19:01:00,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 19:01:00,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 19:01:00,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 19:01:00,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 19:01:00,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 19:01:00,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 19:01:00,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 19:01:00,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 19:01:00,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 19:01:00,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 19:01:00,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 19:01:00,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 19:01:00,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 19:01:00,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 19:01:00,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 19:01:00,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 19:01:00,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 19:01:00,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 19:01:00,667 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 19:01:00,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 19:01:00,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 19:01:00,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 19:01:00,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 19:01:00,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 19:01:00,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 19:01:00,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 19:01:00,687 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 19:01:00,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 19:01:00,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 19:01:00,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 19:01:00,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 19:01:00,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 19:01:00,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 19:01:00,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 19:01:00,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 19:01:00,697 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 19:01:00,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 19:01:00,697 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 19:01:00,697 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 19:01:00,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 19:01:00,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:01:00,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 19:01:00,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 19:01:00,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 19:01:00,698 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 19:01:00,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 19:01:00,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 19:01:00,698 INFO L138 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_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/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_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 [2022-12-14 19:01:00,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 19:01:00,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 19:01:00,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 19:01:00,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 19:01:00,882 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 19:01:00,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2022-12-14 19:01:03,407 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 19:01:03,569 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 19:01:03,569 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2022-12-14 19:01:03,577 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/data/7669b9499/60fa647d56734e42af4241b2269260a6/FLAG666d7f562 [2022-12-14 19:01:03,587 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/data/7669b9499/60fa647d56734e42af4241b2269260a6 [2022-12-14 19:01:03,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 19:01:03,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 19:01:03,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 19:01:03,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 19:01:03,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 19:01:03,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d16733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03, skipping insertion in model container [2022-12-14 19:01:03,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 19:01:03,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 19:01:03,765 WARN L237 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_6548c5bc-1674-4d5c-9020-5bbbc65bd154/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2022-12-14 19:01:03,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:01:03,777 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 19:01:03,816 WARN L237 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_6548c5bc-1674-4d5c-9020-5bbbc65bd154/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2022-12-14 19:01:03,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:01:03,827 INFO L208 MainTranslator]: Completed translation [2022-12-14 19:01:03,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03 WrapperNode [2022-12-14 19:01:03,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 19:01:03,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 19:01:03,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 19:01:03,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 19:01:03,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,868 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 457 [2022-12-14 19:01:03,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 19:01:03,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 19:01:03,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 19:01:03,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 19:01:03,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,898 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 19:01:03,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 19:01:03,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 19:01:03,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 19:01:03,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:01:03" (1/1) ... [2022-12-14 19:01:03,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:01:03,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 19:01:03,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 19:01:03,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 19:01:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 19:01:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 19:01:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 19:01:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 19:01:04,056 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 19:01:04,058 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 19:01:04,515 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 19:01:04,956 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 19:01:04,957 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 19:01:04,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:01:04 BoogieIcfgContainer [2022-12-14 19:01:04,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 19:01:04,960 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 19:01:04,960 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 19:01:04,967 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 19:01:04,967 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:01:04" (1/1) ... [2022-12-14 19:01:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 19:01:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-14 19:01:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-14 19:01:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 19:01:05,020 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2022-12-14 19:01:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2022-12-14 19:01:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 19:01:06,589 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:06,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2022-12-14 19:01:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2022-12-14 19:01:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 19:01:07,638 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2022-12-14 19:01:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2022-12-14 19:01:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 19:01:08,817 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2022-12-14 19:01:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2022-12-14 19:01:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 19:01:10,187 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2022-12-14 19:01:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2022-12-14 19:01:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 19:01:11,748 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2022-12-14 19:01:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2022-12-14 19:01:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 19:01:13,496 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2022-12-14 19:01:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2022-12-14 19:01:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 19:01:13,749 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2022-12-14 19:01:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2022-12-14 19:01:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 19:01:13,792 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:13,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2022-12-14 19:01:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2022-12-14 19:01:16,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 19:01:16,499 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:16,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 60 states and 102 transitions. [2022-12-14 19:01:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2022-12-14 19:01:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 19:01:16,949 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 76 states and 131 transitions. [2022-12-14 19:01:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 131 transitions. [2022-12-14 19:01:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 19:01:22,786 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 90 states and 151 transitions. [2022-12-14 19:01:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 151 transitions. [2022-12-14 19:01:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 19:01:27,641 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 91 states and 154 transitions. [2022-12-14 19:01:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 154 transitions. [2022-12-14 19:01:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 19:01:29,414 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 101 states and 170 transitions. [2022-12-14 19:01:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 170 transitions. [2022-12-14 19:01:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 19:01:33,205 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:33,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 115 states and 191 transitions. [2022-12-14 19:01:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2022-12-14 19:01:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 19:01:37,947 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:37,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 132 states and 220 transitions. [2022-12-14 19:01:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 220 transitions. [2022-12-14 19:01:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 19:01:44,827 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 146 states and 246 transitions. [2022-12-14 19:01:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 246 transitions. [2022-12-14 19:01:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 19:01:49,641 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:49,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 147 states and 251 transitions. [2022-12-14 19:01:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 251 transitions. [2022-12-14 19:01:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 19:01:51,559 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 148 states and 252 transitions. [2022-12-14 19:01:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 252 transitions. [2022-12-14 19:01:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 19:01:52,752 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 149 states and 256 transitions. [2022-12-14 19:01:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 256 transitions. [2022-12-14 19:01:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 19:01:54,076 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:01:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:01:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:01:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 150 states and 262 transitions. [2022-12-14 19:01:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 262 transitions. [2022-12-14 19:01:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 19:01:55,315 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:01:55,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:01:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:01:55,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:01:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:01:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:01:55,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:01:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:01:55,998 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 22 iterations. [2022-12-14 19:01:56,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 07:01:56 ImpRootNode [2022-12-14 19:01:56,063 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 19:01:56,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 19:01:56,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 19:01:56,064 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 19:01:56,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:01:04" (3/4) ... [2022-12-14 19:01:56,066 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 19:01:56,149 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 19:01:56,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 19:01:56,150 INFO L158 Benchmark]: Toolchain (without parser) took 52560.37ms. Allocated memory was 138.4MB in the beginning and 648.0MB in the end (delta: 509.6MB). Free memory was 100.2MB in the beginning and 225.0MB in the end (delta: -124.9MB). Peak memory consumption was 386.6MB. Max. memory is 16.1GB. [2022-12-14 19:01:56,150 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 19:01:56,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.12ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 83.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 19:01:56,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.12ms. Allocated memory is still 138.4MB. Free memory was 83.4MB in the beginning and 80.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 19:01:56,150 INFO L158 Benchmark]: Boogie Preprocessor took 34.84ms. Allocated memory is still 138.4MB. Free memory was 80.1MB in the beginning and 77.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 19:01:56,151 INFO L158 Benchmark]: RCFGBuilder took 1054.20ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 77.5MB in the beginning and 60.7MB in the end (delta: 16.8MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2022-12-14 19:01:56,151 INFO L158 Benchmark]: CodeCheck took 51103.59ms. Allocated memory was 178.3MB in the beginning and 648.0MB in the end (delta: 469.8MB). Free memory was 60.7MB in the beginning and 235.5MB in the end (delta: -174.9MB). Peak memory consumption was 296.0MB. Max. memory is 16.1GB. [2022-12-14 19:01:56,151 INFO L158 Benchmark]: Witness Printer took 85.75ms. Allocated memory is still 648.0MB. Free memory was 235.5MB in the beginning and 225.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 19:01:56,152 INFO L339 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: 51.0s, OverallIterations: 22, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2973 SdHoareTripleChecker+Valid, 21.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2359 mSDsluCounter, 965 SdHoareTripleChecker+Invalid, 19.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 646 mSDsCounter, 1197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7716 IncrementalHoareTripleChecker+Invalid, 8913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1197 mSolverCounterUnsat, 319 mSDtfsCounter, 7716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3373 GetRequests, 2813 SyntacticMatches, 96 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121834 ImplicationChecksByTransitivity, 31.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 3467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 22/67 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: 610]: 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] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND TRUE \read(r131) [L272] COND TRUE \read(ep32) [L273] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND TRUE \read(r211) [L311] COND TRUE \read(ep13) [L312] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND TRUE \read(r321) [L324] COND TRUE \read(ep21) [L325] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [c1=0, ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, i2=0, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=255, 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] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L608] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=127, m2=0, m3=125, max1=127, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 1 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND TRUE (int )m2 > (int )max2 [L154] max2 = m2 [L155] newmax = (_Bool)1 [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND TRUE (int )m3 > (int )max3 [L200] max3 = m3 [L201] newmax = (_Bool)1 [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=0, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, 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=1, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=0, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, 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=1, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=0, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, 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=1, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=0, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, 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=1, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=0, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, 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=1, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=0, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, 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=1, st2=0, st3=0] [L482] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L509] tmp = 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=0, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, 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=1, st2=0, st3=0, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L608] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=0, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, 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=1, st2=0, st3=0] [L610] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=255, id1=127, id2=0, id3=126, m1=0, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, 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=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.12ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 83.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.12ms. Allocated memory is still 138.4MB. Free memory was 83.4MB in the beginning and 80.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.84ms. Allocated memory is still 138.4MB. Free memory was 80.1MB in the beginning and 77.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1054.20ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 77.5MB in the beginning and 60.7MB in the end (delta: 16.8MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * CodeCheck took 51103.59ms. Allocated memory was 178.3MB in the beginning and 648.0MB in the end (delta: 469.8MB). Free memory was 60.7MB in the beginning and 235.5MB in the end (delta: -174.9MB). Peak memory consumption was 296.0MB. Max. memory is 16.1GB. * Witness Printer took 85.75ms. Allocated memory is still 648.0MB. Free memory was 235.5MB in the beginning and 225.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 19:01:56,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6548c5bc-1674-4d5c-9020-5bbbc65bd154/bin/ukojak-rkRKPMF4O4/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