./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.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_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/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_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/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_f3cc71e5-e694-4288-8cac-083530e10b1e/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 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:26:30,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 03:26:30,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 03:26:30,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 03:26:30,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 03:26:30,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 03:26:30,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 03:26:30,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 03:26:30,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 03:26:30,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 03:26:30,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 03:26:30,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 03:26:30,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 03:26:30,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 03:26:30,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 03:26:30,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 03:26:30,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 03:26:30,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 03:26:30,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 03:26:30,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 03:26:30,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 03:26:30,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 03:26:30,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 03:26:30,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 03:26:30,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 03:26:30,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 03:26:30,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 03:26:30,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 03:26:30,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 03:26:30,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 03:26:30,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 03:26:30,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 03:26:30,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 03:26:30,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 03:26:30,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 03:26:30,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 03:26:30,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 03:26:30,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 03:26:30,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 03:26:30,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 03:26:30,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 03:26:30,301 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 03:26:30,358 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 03:26:30,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 03:26:30,363 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 03:26:30,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 03:26:30,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 03:26:30,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 03:26:30,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 03:26:30,367 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 03:26:30,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 03:26:30,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 03:26:30,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 03:26:30,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 03:26:30,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 03:26:30,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 03:26:30,370 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 03:26:30,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 03:26:30,370 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 03:26:30,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 03:26:30,371 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 03:26:30,371 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 03:26:30,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 03:26:30,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:26:30,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 03:26:30,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 03:26:30,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 03:26:30,373 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 03:26:30,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 03:26:30,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 03:26:30,373 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_f3cc71e5-e694-4288-8cac-083530e10b1e/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_f3cc71e5-e694-4288-8cac-083530e10b1e/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 -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2021-10-29 03:26:30,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 03:26:30,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 03:26:30,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 03:26:30,766 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 03:26:30,767 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 03:26:30,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-10-29 03:26:30,883 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/data/5419f1cd8/3d9ee6163fca4fc8bb9584b904c3eb0f/FLAGc0a53b6d1 [2021-10-29 03:26:31,508 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 03:26:31,513 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-10-29 03:26:31,539 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/data/5419f1cd8/3d9ee6163fca4fc8bb9584b904c3eb0f/FLAGc0a53b6d1 [2021-10-29 03:26:31,767 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/data/5419f1cd8/3d9ee6163fca4fc8bb9584b904c3eb0f [2021-10-29 03:26:31,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 03:26:31,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 03:26:31,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 03:26:31,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 03:26:31,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 03:26:31,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:26:31" (1/1) ... [2021-10-29 03:26:31,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34786757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:31, skipping insertion in model container [2021-10-29 03:26:31,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:26:31" (1/1) ... [2021-10-29 03:26:31,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 03:26:31,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 03:26:32,140 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_f3cc71e5-e694-4288-8cac-083530e10b1e/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2021-10-29 03:26:32,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:26:32,156 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 03:26:32,223 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_f3cc71e5-e694-4288-8cac-083530e10b1e/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2021-10-29 03:26:32,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:26:32,242 INFO L208 MainTranslator]: Completed translation [2021-10-29 03:26:32,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:32 WrapperNode [2021-10-29 03:26:32,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 03:26:32,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 03:26:32,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 03:26:32,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 03:26:32,254 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:26:32" (1/1) ... [2021-10-29 03:26:32,268 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:26:32" (1/1) ... [2021-10-29 03:26:32,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 03:26:32,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 03:26:32,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 03:26:32,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 03:26:32,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:32" (1/1) ... [2021-10-29 03:26:32,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:32" (1/1) ... [2021-10-29 03:26:32,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:32" (1/1) ... [2021-10-29 03:26:32,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:32" (1/1) ... [2021-10-29 03:26:32,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:32" (1/1) ... [2021-10-29 03:26:32,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:32" (1/1) ... [2021-10-29 03:26:32,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:32" (1/1) ... [2021-10-29 03:26:32,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 03:26:32,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 03:26:32,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 03:26:32,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 03:26:32,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:26:32" (1/1) ... [2021-10-29 03:26:32,376 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:26:32,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 03:26:32,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 03:26:32,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 03:26:32,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 03:26:32,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 03:26:32,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 03:26:32,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 03:26:35,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 03:26:35,061 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-10-29 03:26:35,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:26:35 BoogieIcfgContainer [2021-10-29 03:26:35,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 03:26:35,065 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 03:26:35,065 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 03:26:35,077 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 03:26:35,077 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:26:35" (1/1) ... [2021-10-29 03:26:35,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 03:26:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-10-29 03:26:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-10-29 03:26:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 03:26:35,142 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:35,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:35,598 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:26:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2021-10-29 03:26:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2021-10-29 03:26:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 03:26:35,688 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:35,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:35,896 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:26:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2021-10-29 03:26:36,182 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2021-10-29 03:26:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 03:26:36,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:36,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:36,332 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:26:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2021-10-29 03:26:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2021-10-29 03:26:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 03:26:36,790 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:36,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:36,968 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:26:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2021-10-29 03:26:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2021-10-29 03:26:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 03:26:37,616 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:37,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:37,941 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:26:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2021-10-29 03:26:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2021-10-29 03:26:38,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 03:26:38,866 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:38,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:39,031 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:26:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2021-10-29 03:26:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2021-10-29 03:26:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 03:26:40,187 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:40,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:40,310 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:26:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2021-10-29 03:26:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2021-10-29 03:26:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 03:26:40,551 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:40,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:40,626 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:26:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2021-10-29 03:26:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2021-10-29 03:26:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 03:26:40,642 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:40,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:40,896 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:26:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2021-10-29 03:26:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2021-10-29 03:26:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 03:26:42,514 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:42,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:42,705 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:26:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2021-10-29 03:26:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2021-10-29 03:26:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 03:26:42,993 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:42,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:43,961 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:26:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 77 states and 148 transitions. [2021-10-29 03:26:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 148 transitions. [2021-10-29 03:26:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 03:26:48,567 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:48,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:48,948 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:26:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 94 states and 187 transitions. [2021-10-29 03:26:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 187 transitions. [2021-10-29 03:26:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 03:26:54,351 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:54,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:54,505 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:26:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:26:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 95 states and 188 transitions. [2021-10-29 03:26:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 188 transitions. [2021-10-29 03:26:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:26:54,910 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:26:54,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:26:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:26:55,356 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:27:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 113 states and 228 transitions. [2021-10-29 03:27:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 228 transitions. [2021-10-29 03:27:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:27:00,921 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:00,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:01,097 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:27:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 115 states and 235 transitions. [2021-10-29 03:27:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 235 transitions. [2021-10-29 03:27:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:27:01,708 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:01,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:01,820 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:27:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 116 states and 237 transitions. [2021-10-29 03:27:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 237 transitions. [2021-10-29 03:27:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 03:27:02,204 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:02,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:02,746 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:27:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 130 states and 266 transitions. [2021-10-29 03:27:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 266 transitions. [2021-10-29 03:27:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 03:27:07,902 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:07,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:07,991 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:27:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 132 states and 275 transitions. [2021-10-29 03:27:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 275 transitions. [2021-10-29 03:27:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 03:27:08,663 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:08,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:08,762 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:27:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 135 states and 282 transitions. [2021-10-29 03:27:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 282 transitions. [2021-10-29 03:27:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 03:27:09,949 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:09,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:11,134 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:27:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 154 states and 320 transitions. [2021-10-29 03:27:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 320 transitions. [2021-10-29 03:27:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 03:27:18,027 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:18,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:18,709 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:27:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 156 states and 326 transitions. [2021-10-29 03:27:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 326 transitions. [2021-10-29 03:27:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 03:27:19,741 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:19,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:20,413 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:27:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 159 states and 331 transitions. [2021-10-29 03:27:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 331 transitions. [2021-10-29 03:27:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 03:27:22,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:22,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:22,636 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:27:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 160 states and 332 transitions. [2021-10-29 03:27:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 332 transitions. [2021-10-29 03:27:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 03:27:23,218 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:23,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:23,820 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:27:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 161 states and 334 transitions. [2021-10-29 03:27:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 334 transitions. [2021-10-29 03:27:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 03:27:24,386 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:24,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:25,079 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:27:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 181 states and 371 transitions. [2021-10-29 03:27:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 371 transitions. [2021-10-29 03:27:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 03:27:31,642 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:31,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:32,736 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:27:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 189 states and 390 transitions. [2021-10-29 03:27:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 390 transitions. [2021-10-29 03:27:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 03:27:38,089 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:38,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:27:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 203 states and 446 transitions. [2021-10-29 03:27:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 446 transitions. [2021-10-29 03:27:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 03:27:48,431 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:48,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:27:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:27:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 208 states and 461 transitions. [2021-10-29 03:27:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 461 transitions. [2021-10-29 03:27:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:27:51,283 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:27:51,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:27:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:27:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 219 states and 479 transitions. [2021-10-29 03:28:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 479 transitions. [2021-10-29 03:28:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:28:00,629 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:00,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 222 states and 489 transitions. [2021-10-29 03:28:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 489 transitions. [2021-10-29 03:28:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:28:03,703 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:03,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 231 states and 517 transitions. [2021-10-29 03:28:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 517 transitions. [2021-10-29 03:28:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:28:09,145 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:09,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 244 states and 548 transitions. [2021-10-29 03:28:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 548 transitions. [2021-10-29 03:28:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:28:18,763 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:18,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 250 states and 561 transitions. [2021-10-29 03:28:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 561 transitions. [2021-10-29 03:28:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:28:22,690 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:22,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 251 states and 564 transitions. [2021-10-29 03:28:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 564 transitions. [2021-10-29 03:28:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 03:28:23,736 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:23,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 261 states and 588 transitions. [2021-10-29 03:28:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 588 transitions. [2021-10-29 03:28:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 03:28:31,799 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:31,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 257 states and 586 transitions. [2021-10-29 03:28:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 586 transitions. [2021-10-29 03:28:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 03:28:33,557 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:33,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 258 states and 590 transitions. [2021-10-29 03:28:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 590 transitions. [2021-10-29 03:28:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-29 03:28:34,730 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:34,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 263 states and 609 transitions. [2021-10-29 03:28:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 609 transitions. [2021-10-29 03:28:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-29 03:28:42,316 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:42,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 265 states and 620 transitions. [2021-10-29 03:28:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 620 transitions. [2021-10-29 03:28:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-29 03:28:44,578 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:44,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 266 states and 623 transitions. [2021-10-29 03:28:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 623 transitions. [2021-10-29 03:28:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:28:45,642 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:45,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 274 states and 648 transitions. [2021-10-29 03:28:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 648 transitions. [2021-10-29 03:28:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:28:52,170 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:52,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 278 states and 662 transitions. [2021-10-29 03:28:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 662 transitions. [2021-10-29 03:28:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:28:55,199 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:55,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 279 states and 667 transitions. [2021-10-29 03:28:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 667 transitions. [2021-10-29 03:28:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:28:56,162 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:56,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:28:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:28:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:28:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 282 states and 678 transitions. [2021-10-29 03:28:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 678 transitions. [2021-10-29 03:28:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-29 03:28:58,620 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:28:58,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:28:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:29:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:29:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:29:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 289 states and 702 transitions. [2021-10-29 03:29:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 702 transitions. [2021-10-29 03:29:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-29 03:29:07,187 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:29:07,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:29:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:29:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:29:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:29:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 290 states and 705 transitions. [2021-10-29 03:29:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 705 transitions. [2021-10-29 03:29:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-29 03:29:08,374 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:29:08,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:29:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:29:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:29:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:29:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 294 states and 719 transitions. [2021-10-29 03:29:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 719 transitions. [2021-10-29 03:29:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-29 03:29:11,553 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:29:11,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:29:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:29:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:29:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:29:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 297 states and 730 transitions. [2021-10-29 03:29:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 730 transitions. [2021-10-29 03:29:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-29 03:29:13,849 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:29:13,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:29:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:29:14,467 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:29:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:29:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:29:15,413 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:29:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:29:15,777 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2021-10-29 03:29:16,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 03:29:16 ImpRootNode [2021-10-29 03:29:16,050 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 03:29:16,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 03:29:16,051 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 03:29:16,051 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 03:29:16,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:26:35" (3/4) ... [2021-10-29 03:29:16,054 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 03:29:16,276 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 03:29:16,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 03:29:16,278 INFO L168 Benchmark]: Toolchain (without parser) took 164505.78 ms. Allocated memory was 111.1 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 74.5 MB in the beginning and 471.0 MB in the end (delta: -396.4 MB). Peak memory consumption was 843.4 MB. Max. memory is 16.1 GB. [2021-10-29 03:29:16,279 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 111.1 MB. Free memory was 91.5 MB in the beginning and 91.4 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:29:16,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.57 ms. Allocated memory is still 111.1 MB. Free memory was 74.3 MB in the beginning and 81.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 03:29:16,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.22 ms. Allocated memory is still 111.1 MB. Free memory was 81.5 MB in the beginning and 78.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 03:29:16,281 INFO L168 Benchmark]: Boogie Preprocessor took 48.89 ms. Allocated memory is still 111.1 MB. Free memory was 78.4 MB in the beginning and 76.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 03:29:16,281 INFO L168 Benchmark]: RCFGBuilder took 2698.54 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 76.3 MB in the beginning and 92.9 MB in the end (delta: -16.6 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.1 GB. [2021-10-29 03:29:16,282 INFO L168 Benchmark]: CodeCheck took 160984.97 ms. Allocated memory was 140.5 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 92.9 MB in the beginning and 491.1 MB in the end (delta: -398.2 MB). Peak memory consumption was 810.8 MB. Max. memory is 16.1 GB. [2021-10-29 03:29:16,282 INFO L168 Benchmark]: Witness Printer took 225.81 ms. Allocated memory is still 1.4 GB. Free memory was 491.1 MB in the beginning and 471.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-29 03:29:16,284 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 160.6s, OverallIterations: 49, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1169948668 SDtfs, 1442625226 SDslu, -1880480928 SDs, 0 SdLazy, 802730510 SolverSat, 204013908 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14198 GetRequests, 12647 SyntacticMatches, 567 SemanticMatches, 984 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564144 ImplicationChecksByTransitivity, 141.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 1370 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1274 ConstructedInterpolants, 0 QuantifiedInterpolants, 15275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 10 PerfectInterpolantSequences, 149/773 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: 531]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L452] int c1 ; [L453] int i2 ; [L456] c1 = 0 [L457] ep12 = __VERIFIER_nondet_bool() [L458] ep13 = __VERIFIER_nondet_bool() [L459] ep21 = __VERIFIER_nondet_bool() [L460] ep23 = __VERIFIER_nondet_bool() [L461] ep31 = __VERIFIER_nondet_bool() [L462] ep32 = __VERIFIER_nondet_bool() [L463] id1 = __VERIFIER_nondet_char() [L464] r1 = __VERIFIER_nondet_char() [L465] st1 = __VERIFIER_nondet_char() [L466] nl1 = __VERIFIER_nondet_char() [L467] m1 = __VERIFIER_nondet_char() [L468] max1 = __VERIFIER_nondet_char() [L469] mode1 = __VERIFIER_nondet_bool() [L470] id2 = __VERIFIER_nondet_char() [L471] r2 = __VERIFIER_nondet_char() [L472] st2 = __VERIFIER_nondet_char() [L473] nl2 = __VERIFIER_nondet_char() [L474] m2 = __VERIFIER_nondet_char() [L475] max2 = __VERIFIER_nondet_char() [L476] mode2 = __VERIFIER_nondet_bool() [L477] id3 = __VERIFIER_nondet_char() [L478] r3 = __VERIFIER_nondet_char() [L479] st3 = __VERIFIER_nondet_char() [L480] nl3 = __VERIFIER_nondet_char() [L481] m3 = __VERIFIER_nondet_char() [L482] max3 = __VERIFIER_nondet_char() [L483] mode3 = __VERIFIER_nondet_bool() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND FALSE !(\read(r131)) [L238] tmp = 0 [L240] r122 = (_Bool )tmp [L241] COND FALSE !(\read(r131)) [L244] COND FALSE !(\read(r121)) [L251] tmp___0 = 0 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND FALSE !(\read(r231)) [L264] tmp___1 = 0 [L266] r212 = (_Bool )tmp___1 [L267] COND FALSE !(\read(r231)) [L270] COND FALSE !(\read(r211)) [L277] tmp___2 = 0 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND FALSE !(\read(r321)) [L296] COND TRUE \read(r311) [L297] COND FALSE !(\read(ep12)) [L300] tmp___4 = 0 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE (int )max1 == (int )id1 [L316] COND TRUE (int )max2 == (int )id2 [L317] COND TRUE (int )max3 == (int )id3 [L318] COND TRUE (int )st1 == 0 [L319] COND TRUE (int )st2 == 0 [L320] COND TRUE (int )st3 == 0 [L321] COND TRUE (int )nl1 == 0 [L322] COND TRUE (int )nl2 == 0 [L323] COND TRUE (int )nl3 == 0 [L324] COND TRUE (int )mode1 == 0 [L325] COND TRUE (int )mode2 == 0 [L326] COND TRUE (int )mode3 == 0 [L327] tmp___5 = 1 [L391] return (tmp___5); [L484] i2 = init() [L485] COND FALSE !(!(i2)) [L486] p12_old = nomsg [L487] p12_new = nomsg [L488] p13_old = nomsg [L489] p13_new = nomsg [L490] p21_old = nomsg [L491] p21_new = nomsg [L492] p23_old = nomsg [L493] p23_new = nomsg [L494] p31_old = nomsg [L495] p31_new = nomsg [L496] p32_old = nomsg [L497] p32_new = nomsg [L498] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L499] COND TRUE i2 < 6 [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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 TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L447] return (tmp); [L516] c1 = check() [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L518] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=2, m2=3, m3=2, 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] [L499] COND TRUE i2 < 6 [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND FALSE !(\read(ep32)) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND FALSE !(\read(ep23)) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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 TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L447] return (tmp); [L516] c1 = check() [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L518] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L499] COND TRUE i2 < 6 [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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 TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L447] return (tmp); [L516] c1 = check() [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L518] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, 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] [L499] COND TRUE i2 < 6 [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] nl1 = (char)1 [L98] mode1 = (_Bool)0 [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND FALSE !(\read(ep32)) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND FALSE !(\read(ep23)) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=1, 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=0, st2=1, st3=1] [L399] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L445] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=1, 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=0, st2=1, st3=1] [L447] return (tmp); [L516] c1 = check() [L529] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=1, 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=0, st2=1, st3=1] [L531] reach_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=1, 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=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 111.1 MB. Free memory was 91.5 MB in the beginning and 91.4 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 467.57 ms. Allocated memory is still 111.1 MB. Free memory was 74.3 MB in the beginning and 81.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.22 ms. Allocated memory is still 111.1 MB. Free memory was 81.5 MB in the beginning and 78.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.89 ms. Allocated memory is still 111.1 MB. Free memory was 78.4 MB in the beginning and 76.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2698.54 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 76.3 MB in the beginning and 92.9 MB in the end (delta: -16.6 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.1 GB. * CodeCheck took 160984.97 ms. Allocated memory was 140.5 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 92.9 MB in the beginning and 491.1 MB in the end (delta: -398.2 MB). Peak memory consumption was 810.8 MB. Max. memory is 16.1 GB. * Witness Printer took 225.81 ms. Allocated memory is still 1.4 GB. Free memory was 491.1 MB in the beginning and 471.0 MB in the end (delta: 20.1 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:29:16,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3cc71e5-e694-4288-8cac-083530e10b1e/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...