./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI --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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 03:15:19,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 03:15:19,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 03:15:19,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 03:15:19,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 03:15:19,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 03:15:19,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 03:15:19,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 03:15:19,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 03:15:19,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 03:15:19,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 03:15:19,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 03:15:19,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 03:15:19,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 03:15:19,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 03:15:19,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 03:15:19,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 03:15:19,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 03:15:19,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 03:15:19,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 03:15:19,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 03:15:19,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 03:15:19,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 03:15:19,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 03:15:19,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 03:15:19,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 03:15:19,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 03:15:19,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 03:15:19,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 03:15:19,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 03:15:19,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 03:15:19,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 03:15:19,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 03:15:19,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 03:15:19,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 03:15:19,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 03:15:19,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 03:15:19,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 03:15:19,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 03:15:19,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 03:15:19,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 03:15:19,113 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 03:15:19,137 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 03:15:19,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 03:15:19,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 03:15:19,139 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 03:15:19,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 03:15:19,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 03:15:19,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 03:15:19,140 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 03:15:19,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 03:15:19,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 03:15:19,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 03:15:19,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 03:15:19,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 03:15:19,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 03:15:19,141 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 03:15:19,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 03:15:19,142 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 03:15:19,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 03:15:19,142 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 03:15:19,142 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 03:15:19,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 03:15:19,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:15:19,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 03:15:19,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 03:15:19,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 03:15:19,143 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 03:15:19,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 03:15:19,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 03:15:19,144 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_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/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_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI 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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2021-10-29 03:15:19,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 03:15:19,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 03:15:19,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 03:15:19,413 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 03:15:19,415 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 03:15:19,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2021-10-29 03:15:19,496 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/data/20ee2e90e/bb0c9ef40b0a4f01be290e7edcb4ad01/FLAGebf426e44 [2021-10-29 03:15:20,013 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 03:15:20,014 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2021-10-29 03:15:20,038 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/data/20ee2e90e/bb0c9ef40b0a4f01be290e7edcb4ad01/FLAGebf426e44 [2021-10-29 03:15:20,346 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/data/20ee2e90e/bb0c9ef40b0a4f01be290e7edcb4ad01 [2021-10-29 03:15:20,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 03:15:20,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 03:15:20,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 03:15:20,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 03:15:20,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 03:15:20,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b3224d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20, skipping insertion in model container [2021-10-29 03:15:20,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 03:15:20,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 03:15:20,682 WARN L228 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_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2021-10-29 03:15:20,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:15:20,694 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 03:15:20,801 WARN L228 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_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2021-10-29 03:15:20,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:15:20,816 INFO L208 MainTranslator]: Completed translation [2021-10-29 03:15:20,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20 WrapperNode [2021-10-29 03:15:20,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 03:15:20,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 03:15:20,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 03:15:20,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 03:15:20,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 03:15:20,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 03:15:20,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 03:15:20,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 03:15:20,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 03:15:20,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 03:15:20,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 03:15:20,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 03:15:20,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:15:20" (1/1) ... [2021-10-29 03:15:20,954 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:15:20,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 03:15:20,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 03:15:20,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 03:15:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 03:15:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 03:15:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 03:15:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 03:15:23,187 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 03:15:23,188 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-29 03:15:23,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:15:23 BoogieIcfgContainer [2021-10-29 03:15:23,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 03:15:23,191 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 03:15:23,191 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 03:15:23,201 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 03:15:23,202 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:15:23" (1/1) ... [2021-10-29 03:15:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 03:15:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2021-10-29 03:15:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2021-10-29 03:15:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 03:15:23,255 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:23,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2021-10-29 03:15:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2021-10-29 03:15:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 03:15:24,165 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:24,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2021-10-29 03:15:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2021-10-29 03:15:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 03:15:24,755 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:24,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2021-10-29 03:15:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2021-10-29 03:15:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 03:15:25,454 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:25,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2021-10-29 03:15:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2021-10-29 03:15:26,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 03:15:26,345 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:26,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2021-10-29 03:15:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2021-10-29 03:15:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 03:15:27,438 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:27,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2021-10-29 03:15:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2021-10-29 03:15:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 03:15:28,700 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:28,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2021-10-29 03:15:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2021-10-29 03:15:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 03:15:29,043 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:29,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2021-10-29 03:15:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2021-10-29 03:15:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 03:15:31,029 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:31,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 56 states and 96 transitions. [2021-10-29 03:15:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 96 transitions. [2021-10-29 03:15:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 03:15:31,177 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:31,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 59 states and 108 transitions. [2021-10-29 03:15:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 108 transitions. [2021-10-29 03:15:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 03:15:31,545 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:31,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 74 states and 139 transitions. [2021-10-29 03:15:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 139 transitions. [2021-10-29 03:15:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 03:15:36,656 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:36,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 90 states and 172 transitions. [2021-10-29 03:15:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 172 transitions. [2021-10-29 03:15:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 03:15:41,921 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:41,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 91 states and 175 transitions. [2021-10-29 03:15:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 175 transitions. [2021-10-29 03:15:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 03:15:42,568 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:42,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 108 states and 210 transitions. [2021-10-29 03:15:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 210 transitions. [2021-10-29 03:15:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 03:15:49,417 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:49,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 110 states and 215 transitions. [2021-10-29 03:15:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 215 transitions. [2021-10-29 03:15:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:15:50,453 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:50,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 125 states and 247 transitions. [2021-10-29 03:15:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 247 transitions. [2021-10-29 03:15:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:15:57,734 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:57,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:15:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:15:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 127 states and 255 transitions. [2021-10-29 03:15:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 255 transitions. [2021-10-29 03:15:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:15:58,861 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:15:58,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:15:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:15:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 130 states and 261 transitions. [2021-10-29 03:16:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 261 transitions. [2021-10-29 03:16:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 03:16:00,200 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:00,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 146 states and 289 transitions. [2021-10-29 03:16:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 289 transitions. [2021-10-29 03:16:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 03:16:08,635 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:08,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 150 states and 301 transitions. [2021-10-29 03:16:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 301 transitions. [2021-10-29 03:16:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 03:16:11,232 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:11,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 152 states and 303 transitions. [2021-10-29 03:16:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 303 transitions. [2021-10-29 03:16:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 03:16:12,687 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:12,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 153 states and 304 transitions. [2021-10-29 03:16:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 304 transitions. [2021-10-29 03:16:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 03:16:13,613 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:13,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 166 states and 327 transitions. [2021-10-29 03:16:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 327 transitions. [2021-10-29 03:16:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 03:16:18,837 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:18,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 173 states and 344 transitions. [2021-10-29 03:16:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 344 transitions. [2021-10-29 03:16:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 03:16:24,378 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:24,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 185 states and 375 transitions. [2021-10-29 03:16:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 375 transitions. [2021-10-29 03:16:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 03:16:31,058 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:31,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 195 states and 395 transitions. [2021-10-29 03:16:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 395 transitions. [2021-10-29 03:16:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 03:16:38,207 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:38,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 204 states and 413 transitions. [2021-10-29 03:16:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 413 transitions. [2021-10-29 03:16:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 03:16:45,748 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:45,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 206 states and 420 transitions. [2021-10-29 03:16:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 420 transitions. [2021-10-29 03:16:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:16:47,816 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:47,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 214 states and 435 transitions. [2021-10-29 03:16:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 435 transitions. [2021-10-29 03:16:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:16:54,329 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:54,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 215 states and 438 transitions. [2021-10-29 03:16:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 438 transitions. [2021-10-29 03:16:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:16:55,693 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:55,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:16:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:16:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 217 states and 446 transitions. [2021-10-29 03:16:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 446 transitions. [2021-10-29 03:16:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 03:16:57,677 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:16:57,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:16:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:16:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 221 states and 461 transitions. [2021-10-29 03:17:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 461 transitions. [2021-10-29 03:17:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 03:17:03,677 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:03,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 222 states and 463 transitions. [2021-10-29 03:17:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 463 transitions. [2021-10-29 03:17:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 03:17:04,836 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:04,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 224 states and 472 transitions. [2021-10-29 03:17:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 472 transitions. [2021-10-29 03:17:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 03:17:06,506 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:06,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 230 states and 490 transitions. [2021-10-29 03:17:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 490 transitions. [2021-10-29 03:17:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 03:17:11,189 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:11,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 234 states and 503 transitions. [2021-10-29 03:17:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 503 transitions. [2021-10-29 03:17:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 03:17:14,422 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:14,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 238 states and 514 transitions. [2021-10-29 03:17:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 514 transitions. [2021-10-29 03:17:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 03:17:17,431 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:17,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 239 states and 518 transitions. [2021-10-29 03:17:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 518 transitions. [2021-10-29 03:17:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:17:18,534 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:18,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 240 states and 523 transitions. [2021-10-29 03:17:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 523 transitions. [2021-10-29 03:17:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:17:21,640 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:21,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 245 states and 537 transitions. [2021-10-29 03:17:25,177 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 537 transitions. [2021-10-29 03:17:25,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:17:25,178 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:25,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 248 states and 549 transitions. [2021-10-29 03:17:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 549 transitions. [2021-10-29 03:17:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:17:27,395 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:27,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 252 states and 559 transitions. [2021-10-29 03:17:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 559 transitions. [2021-10-29 03:17:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:17:29,981 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:29,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:17:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:17:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:17:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 253 states and 561 transitions. [2021-10-29 03:17:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 561 transitions. [2021-10-29 03:17:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-29 03:17:31,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:17:31,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:17:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:17:31,823 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:17:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:17:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:17:32,632 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:17:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:17:32,955 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 44 iterations. [2021-10-29 03:17:33,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 03:17:33 ImpRootNode [2021-10-29 03:17:33,260 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 03:17:33,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 03:17:33,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 03:17:33,261 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 03:17:33,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:15:23" (3/4) ... [2021-10-29 03:17:33,263 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 03:17:33,506 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 03:17:33,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 03:17:33,510 INFO L168 Benchmark]: Toolchain (without parser) took 133159.33 ms. Allocated memory was 104.9 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 68.0 MB in the beginning and 897.3 MB in the end (delta: -829.3 MB). Peak memory consumption was 220.3 MB. Max. memory is 16.1 GB. [2021-10-29 03:17:33,511 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 104.9 MB. Free memory was 78.7 MB in the beginning and 78.7 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:17:33,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.91 ms. Allocated memory is still 104.9 MB. Free memory was 68.0 MB in the beginning and 74.0 MB in the end (delta: -6.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 03:17:33,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.30 ms. Allocated memory is still 104.9 MB. Free memory was 74.0 MB in the beginning and 70.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 03:17:33,512 INFO L168 Benchmark]: Boogie Preprocessor took 55.73 ms. Allocated memory is still 104.9 MB. Free memory was 70.9 MB in the beginning and 68.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 03:17:33,513 INFO L168 Benchmark]: RCFGBuilder took 2245.40 ms. Allocated memory was 104.9 MB in the beginning and 138.4 MB in the end (delta: 33.6 MB). Free memory was 68.8 MB in the beginning and 87.3 MB in the end (delta: -18.4 MB). Peak memory consumption was 63.2 MB. Max. memory is 16.1 GB. [2021-10-29 03:17:33,513 INFO L168 Benchmark]: CodeCheck took 130069.23 ms. Allocated memory was 138.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 87.3 MB in the beginning and 917.2 MB in the end (delta: -829.9 MB). Peak memory consumption was 185.1 MB. Max. memory is 16.1 GB. [2021-10-29 03:17:33,514 INFO L168 Benchmark]: Witness Printer took 247.94 ms. Allocated memory is still 1.2 GB. Free memory was 917.2 MB in the beginning and 897.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-29 03:17:33,517 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 129.7s, OverallIterations: 44, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, -1903575130 SDslu, 0 SDs, 0 SdLazy, 2113568824 SolverSat, -1580727046 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 98.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12492 GetRequests, 11105 SyntacticMatches, 505 SemanticMatches, 882 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458060 ImplicationChecksByTransitivity, 106.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 10.9s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1170 NumberOfCodeBlocks, 1170 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1082 ConstructedInterpolants, 0 QuantifiedInterpolants, 10981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 10 PerfectInterpolantSequences, 132/681 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 543]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L465] int c1 ; [L466] int i2 ; [L469] c1 = 0 [L470] ep12 = __VERIFIER_nondet_bool() [L471] ep13 = __VERIFIER_nondet_bool() [L472] ep21 = __VERIFIER_nondet_bool() [L473] ep23 = __VERIFIER_nondet_bool() [L474] ep31 = __VERIFIER_nondet_bool() [L475] ep32 = __VERIFIER_nondet_bool() [L476] id1 = __VERIFIER_nondet_char() [L477] r1 = __VERIFIER_nondet_uchar() [L478] st1 = __VERIFIER_nondet_char() [L479] nl1 = __VERIFIER_nondet_char() [L480] m1 = __VERIFIER_nondet_char() [L481] max1 = __VERIFIER_nondet_char() [L482] mode1 = __VERIFIER_nondet_bool() [L483] id2 = __VERIFIER_nondet_char() [L484] r2 = __VERIFIER_nondet_uchar() [L485] st2 = __VERIFIER_nondet_char() [L486] nl2 = __VERIFIER_nondet_char() [L487] m2 = __VERIFIER_nondet_char() [L488] max2 = __VERIFIER_nondet_char() [L489] mode2 = __VERIFIER_nondet_bool() [L490] id3 = __VERIFIER_nondet_char() [L491] r3 = __VERIFIER_nondet_uchar() [L492] st3 = __VERIFIER_nondet_char() [L493] nl3 = __VERIFIER_nondet_char() [L494] m3 = __VERIFIER_nondet_char() [L495] max3 = __VERIFIER_nondet_char() [L496] mode3 = __VERIFIER_nondet_bool() [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 FALSE !(\read(r121)) [L244] COND FALSE !(\read(r131)) [L251] tmp = 0 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND FALSE !(\read(r121)) [L264] tmp___0 = 0 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND FALSE !(\read(r231)) [L277] tmp___1 = 0 [L279] r212 = (_Bool )tmp___1 [L280] COND FALSE !(\read(r231)) [L283] COND FALSE !(\read(r211)) [L290] tmp___2 = 0 [L292] r232 = (_Bool )tmp___2 [L293] COND FALSE !(\read(r311)) [L296] COND TRUE \read(r321) [L297] COND FALSE !(\read(ep21)) [L300] tmp___3 = 0 [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 (int )max1 == (int )id1 [L329] COND TRUE (int )max2 == (int )id2 [L330] COND TRUE (int )max3 == (int )id3 [L331] COND TRUE (int )st1 == 0 [L332] COND TRUE (int )st2 == 0 [L333] COND TRUE (int )st3 == 0 [L334] COND TRUE (int )nl1 == 0 [L335] COND TRUE (int )nl2 == 0 [L336] COND TRUE (int )nl3 == 0 [L337] COND TRUE (int )mode1 == 0 [L338] COND TRUE (int )mode2 == 0 [L339] COND TRUE (int )mode3 == 0 [L340] tmp___5 = 1 [L404] return (tmp___5); [L497] i2 = init() [L22] COND FALSE !(!cond) [L499] p12_old = nomsg [L500] p12_new = nomsg [L501] p13_old = nomsg [L502] p13_new = nomsg [L503] p21_old = nomsg [L504] p21_new = nomsg [L505] p23_old = nomsg [L506] p23_new = nomsg [L507] p31_old = nomsg [L508] p31_new = nomsg [L509] p32_old = nomsg [L510] p32_new = nomsg [L511] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND TRUE 1 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND TRUE \read(ep32) [L204] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L460] return (tmp); [L529] c1 = check() [L541] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND TRUE 1 [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [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 [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, 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] [L460] return (tmp); [L529] c1 = check() [L541] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, 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] [L512] COND TRUE 1 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND TRUE \read(ep32) [L204] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L460] return (tmp); [L529] c1 = check() [L541] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=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=0, st2=0, st3=0] [L512] COND TRUE 1 [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [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 [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L412] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L458] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L460] return (tmp); [L529] c1 = check() [L541] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L543] reach_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=1, max1=0, max2=2, max3=1, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 104.9 MB. Free memory was 78.7 MB in the beginning and 78.7 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 459.91 ms. Allocated memory is still 104.9 MB. Free memory was 68.0 MB in the beginning and 74.0 MB in the end (delta: -6.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.30 ms. Allocated memory is still 104.9 MB. Free memory was 74.0 MB in the beginning and 70.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.73 ms. Allocated memory is still 104.9 MB. Free memory was 70.9 MB in the beginning and 68.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2245.40 ms. Allocated memory was 104.9 MB in the beginning and 138.4 MB in the end (delta: 33.6 MB). Free memory was 68.8 MB in the beginning and 87.3 MB in the end (delta: -18.4 MB). Peak memory consumption was 63.2 MB. Max. memory is 16.1 GB. * CodeCheck took 130069.23 ms. Allocated memory was 138.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 87.3 MB in the beginning and 917.2 MB in the end (delta: -829.9 MB). Peak memory consumption was 185.1 MB. Max. memory is 16.1 GB. * Witness Printer took 247.94 ms. Allocated memory is still 1.2 GB. Free memory was 917.2 MB in the beginning and 897.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! [2021-10-29 03:17:33,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd7667d-9d1e-4862-8f9c-64d235b6e5c3/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...