./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:01:26,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:01:26,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:01:26,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:01:26,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:01:26,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:01:26,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:01:26,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:01:26,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:01:26,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:01:26,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:01:26,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:01:26,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:01:26,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:01:26,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:01:26,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:01:26,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:01:26,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:01:26,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:01:26,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:01:26,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:01:26,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:01:26,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:01:26,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:01:26,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:01:26,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:01:26,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:01:26,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:01:26,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:01:26,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:01:26,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:01:26,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:01:26,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:01:26,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:01:26,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:01:26,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:01:26,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:01:26,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:01:26,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:01:26,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:01:26,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:01:26,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:01:26,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:01:26,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:01:26,291 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:01:26,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:01:26,292 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:01:26,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:01:26,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:01:26,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:01:26,295 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:01:26,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:01:26,296 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:01:26,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:01:26,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:01:26,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:01:26,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:01:26,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:01:26,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:01:26,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:01:26,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:01:26,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:01:26,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:01:26,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:01:26,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:01:26,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:01:26,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:01:26,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:01:26,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:01:26,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:01:26,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:01:26,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:01:26,304 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:01:26,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:01:26,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:01:26,305 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_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/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_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8 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 -> Automizer 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 -> a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef [2022-11-16 11:01:26,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:01:26,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:01:26,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:01:26,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:01:26,670 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:01:26,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2022-11-16 11:01:26,795 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/data/dde00996a/ed230a5ad8e44b95851ea39cbe070faa/FLAGa1c3b88d5 [2022-11-16 11:01:27,492 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:01:27,503 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2022-11-16 11:01:27,519 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/data/dde00996a/ed230a5ad8e44b95851ea39cbe070faa/FLAGa1c3b88d5 [2022-11-16 11:01:27,736 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/data/dde00996a/ed230a5ad8e44b95851ea39cbe070faa [2022-11-16 11:01:27,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:01:27,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:01:27,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:01:27,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:01:27,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:01:27,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:01:27" (1/1) ... [2022-11-16 11:01:27,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b87317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:27, skipping insertion in model container [2022-11-16 11:01:27,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:01:27" (1/1) ... [2022-11-16 11:01:27,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:01:27,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:01:27,957 WARN L229 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_a05f33c5-bf0b-44da-95fd-19c521784de7/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2022-11-16 11:01:28,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:01:28,336 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:01:28,355 WARN L229 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_a05f33c5-bf0b-44da-95fd-19c521784de7/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2022-11-16 11:01:28,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:01:28,528 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:01:28,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28 WrapperNode [2022-11-16 11:01:28,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:01:28,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:01:28,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:01:28,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:01:28,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,642 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-11-16 11:01:28,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:01:28,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:01:28,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:01:28,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:01:28,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,700 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:01:28,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:01:28,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:01:28,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:01:28,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (1/1) ... [2022-11-16 11:01:28,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:01:28,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:01:28,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:01:28,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:01:28,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:01:28,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:01:28,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:01:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:01:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:01:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:01:28,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:01:28,803 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:01:28,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:01:28,803 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:01:28,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:01:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:01:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:01:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:01:28,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:01:28,806 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:01:29,081 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:01:29,097 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:01:29,497 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:01:29,751 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:01:29,752 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:01:29,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:01:29 BoogieIcfgContainer [2022-11-16 11:01:29,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:01:29,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:01:29,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:01:29,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:01:29,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:01:27" (1/3) ... [2022-11-16 11:01:29,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ded910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:01:29, skipping insertion in model container [2022-11-16 11:01:29,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:28" (2/3) ... [2022-11-16 11:01:29,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ded910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:01:29, skipping insertion in model container [2022-11-16 11:01:29,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:01:29" (3/3) ... [2022-11-16 11:01:29,767 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2022-11-16 11:01:29,778 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:01:29,791 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:01:29,791 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:01:29,791 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:01:29,909 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:01:29,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-11-16 11:01:30,046 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-11-16 11:01:30,046 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:01:30,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-16 11:01:30,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2022-11-16 11:01:30,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2022-11-16 11:01:30,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:01:30,079 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39ca73d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:01:30,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:01:30,124 INFO L130 PetriNetUnfolder]: 0/62 cut-off events. [2022-11-16 11:01:30,142 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:01:30,142 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:30,143 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:30,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:30,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1954520861, now seen corresponding path program 1 times [2022-11-16 11:01:30,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:30,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387863054] [2022-11-16 11:01:30,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:31,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387863054] [2022-11-16 11:01:31,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387863054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:31,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:31,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:01:31,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893096371] [2022-11-16 11:01:31,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:31,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:01:31,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:31,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:01:31,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:01:31,198 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2022-11-16 11:01:31,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:31,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:31,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2022-11-16 11:01:31,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:31,516 INFO L130 PetriNetUnfolder]: 57/492 cut-off events. [2022-11-16 11:01:31,516 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 11:01:31,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 492 events. 57/492 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2554 event pairs, 31 based on Foata normal form. 18/479 useless extension candidates. Maximal degree in co-relation 562. Up to 75 conditions per place. [2022-11-16 11:01:31,539 INFO L137 encePairwiseOnDemand]: 116/121 looper letters, 13 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2022-11-16 11:01:31,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 119 transitions, 280 flow [2022-11-16 11:01:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:01:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:01:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2022-11-16 11:01:31,588 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2022-11-16 11:01:31,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2022-11-16 11:01:31,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2022-11-16 11:01:31,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:31,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2022-11-16 11:01:31,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:31,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:31,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:31,608 INFO L175 Difference]: Start difference. First operand has 126 places, 118 transitions, 245 flow. Second operand 3 states and 341 transitions. [2022-11-16 11:01:31,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 119 transitions, 280 flow [2022-11-16 11:01:31,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:01:31,622 INFO L231 Difference]: Finished difference. Result has 123 places, 114 transitions, 238 flow [2022-11-16 11:01:31,626 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=123, PETRI_TRANSITIONS=114} [2022-11-16 11:01:31,634 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2022-11-16 11:01:31,636 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 114 transitions, 238 flow [2022-11-16 11:01:31,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:31,636 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:31,637 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:31,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:01:31,638 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash 520399777, now seen corresponding path program 1 times [2022-11-16 11:01:31,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:31,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281974759] [2022-11-16 11:01:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:32,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:32,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281974759] [2022-11-16 11:01:32,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281974759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:32,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:32,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:01:32,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379639554] [2022-11-16 11:01:32,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:32,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:01:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:01:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:01:32,703 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 121 [2022-11-16 11:01:32,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 114 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:32,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:32,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 121 [2022-11-16 11:01:32,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:33,896 INFO L130 PetriNetUnfolder]: 1427/3654 cut-off events. [2022-11-16 11:01:33,897 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-11-16 11:01:33,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5984 conditions, 3654 events. 1427/3654 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29716 event pairs, 264 based on Foata normal form. 0/3564 useless extension candidates. Maximal degree in co-relation 5919. Up to 1116 conditions per place. [2022-11-16 11:01:33,923 INFO L137 encePairwiseOnDemand]: 113/121 looper letters, 33 selfloop transitions, 4 changer transitions 66/175 dead transitions. [2022-11-16 11:01:33,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 175 transitions, 558 flow [2022-11-16 11:01:33,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:01:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:01:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 954 transitions. [2022-11-16 11:01:33,931 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7884297520661157 [2022-11-16 11:01:33,932 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 954 transitions. [2022-11-16 11:01:33,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 954 transitions. [2022-11-16 11:01:33,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:33,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 954 transitions. [2022-11-16 11:01:33,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.4) internal successors, (954), 10 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:33,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:33,944 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:33,944 INFO L175 Difference]: Start difference. First operand has 123 places, 114 transitions, 238 flow. Second operand 10 states and 954 transitions. [2022-11-16 11:01:33,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 175 transitions, 558 flow [2022-11-16 11:01:33,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 175 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:01:33,952 INFO L231 Difference]: Finished difference. Result has 137 places, 102 transitions, 234 flow [2022-11-16 11:01:33,952 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=234, PETRI_PLACES=137, PETRI_TRANSITIONS=102} [2022-11-16 11:01:33,954 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2022-11-16 11:01:33,954 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 102 transitions, 234 flow [2022-11-16 11:01:33,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:33,955 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:33,956 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:33,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:01:33,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1071210814, now seen corresponding path program 1 times [2022-11-16 11:01:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:33,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353870830] [2022-11-16 11:01:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:33,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:34,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:34,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353870830] [2022-11-16 11:01:34,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353870830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:34,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:34,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:01:34,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083379651] [2022-11-16 11:01:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:34,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:01:34,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:34,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:01:34,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:01:34,339 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 121 [2022-11-16 11:01:34,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 102 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:34,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:34,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 121 [2022-11-16 11:01:34,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:34,775 INFO L130 PetriNetUnfolder]: 216/637 cut-off events. [2022-11-16 11:01:34,775 INFO L131 PetriNetUnfolder]: For 167/167 co-relation queries the response was YES. [2022-11-16 11:01:34,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 637 events. 216/637 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3444 event pairs, 74 based on Foata normal form. 16/629 useless extension candidates. Maximal degree in co-relation 1106. Up to 151 conditions per place. [2022-11-16 11:01:34,780 INFO L137 encePairwiseOnDemand]: 115/121 looper letters, 18 selfloop transitions, 2 changer transitions 28/134 dead transitions. [2022-11-16 11:01:34,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 134 transitions, 414 flow [2022-11-16 11:01:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:01:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:01:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 950 transitions. [2022-11-16 11:01:34,784 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8723599632690542 [2022-11-16 11:01:34,785 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 950 transitions. [2022-11-16 11:01:34,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 950 transitions. [2022-11-16 11:01:34,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:34,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 950 transitions. [2022-11-16 11:01:34,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.55555555555556) internal successors, (950), 9 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:34,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:34,793 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:34,794 INFO L175 Difference]: Start difference. First operand has 137 places, 102 transitions, 234 flow. Second operand 9 states and 950 transitions. [2022-11-16 11:01:34,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 134 transitions, 414 flow [2022-11-16 11:01:34,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 134 transitions, 378 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-16 11:01:34,801 INFO L231 Difference]: Finished difference. Result has 125 places, 102 transitions, 234 flow [2022-11-16 11:01:34,801 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=234, PETRI_PLACES=125, PETRI_TRANSITIONS=102} [2022-11-16 11:01:34,802 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, -1 predicate places. [2022-11-16 11:01:34,802 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 102 transitions, 234 flow [2022-11-16 11:01:34,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:34,803 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:34,804 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:34,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:01:34,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1551975037, now seen corresponding path program 1 times [2022-11-16 11:01:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:34,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065399159] [2022-11-16 11:01:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:35,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:35,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065399159] [2022-11-16 11:01:35,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065399159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:35,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:35,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:01:35,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058483632] [2022-11-16 11:01:35,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:35,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:01:35,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:35,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:01:35,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:01:35,714 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 121 [2022-11-16 11:01:35,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 102 transitions, 234 flow. Second operand has 11 states, 11 states have (on average 96.54545454545455) internal successors, (1062), 11 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:35,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:35,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 121 [2022-11-16 11:01:35,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:36,357 INFO L130 PetriNetUnfolder]: 234/671 cut-off events. [2022-11-16 11:01:36,358 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2022-11-16 11:01:36,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 671 events. 234/671 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3492 event pairs, 67 based on Foata normal form. 12/661 useless extension candidates. Maximal degree in co-relation 1199. Up to 242 conditions per place. [2022-11-16 11:01:36,364 INFO L137 encePairwiseOnDemand]: 108/121 looper letters, 25 selfloop transitions, 12 changer transitions 28/146 dead transitions. [2022-11-16 11:01:36,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 146 transitions, 480 flow [2022-11-16 11:01:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:01:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:01:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1302 transitions. [2022-11-16 11:01:36,370 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8277177368086459 [2022-11-16 11:01:36,371 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1302 transitions. [2022-11-16 11:01:36,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1302 transitions. [2022-11-16 11:01:36,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:36,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1302 transitions. [2022-11-16 11:01:36,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.15384615384616) internal successors, (1302), 13 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:36,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:36,389 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:36,389 INFO L175 Difference]: Start difference. First operand has 125 places, 102 transitions, 234 flow. Second operand 13 states and 1302 transitions. [2022-11-16 11:01:36,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 146 transitions, 480 flow [2022-11-16 11:01:36,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 146 transitions, 448 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-16 11:01:36,401 INFO L231 Difference]: Finished difference. Result has 131 places, 109 transitions, 309 flow [2022-11-16 11:01:36,402 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=309, PETRI_PLACES=131, PETRI_TRANSITIONS=109} [2022-11-16 11:01:36,404 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 5 predicate places. [2022-11-16 11:01:36,410 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 109 transitions, 309 flow [2022-11-16 11:01:36,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 96.54545454545455) internal successors, (1062), 11 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:36,411 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:36,412 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:36,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:01:36,413 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash -959441315, now seen corresponding path program 2 times [2022-11-16 11:01:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:36,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939057750] [2022-11-16 11:01:36,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:37,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:37,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939057750] [2022-11-16 11:01:37,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939057750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:37,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:37,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:01:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747427144] [2022-11-16 11:01:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:37,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:01:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:01:37,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:01:37,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 121 [2022-11-16 11:01:37,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 109 transitions, 309 flow. Second operand has 12 states, 12 states have (on average 96.41666666666667) internal successors, (1157), 12 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:37,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:37,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 121 [2022-11-16 11:01:37,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:38,338 INFO L130 PetriNetUnfolder]: 230/668 cut-off events. [2022-11-16 11:01:38,338 INFO L131 PetriNetUnfolder]: For 1858/1908 co-relation queries the response was YES. [2022-11-16 11:01:38,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 668 events. 230/668 cut-off events. For 1858/1908 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3451 event pairs, 65 based on Foata normal form. 17/663 useless extension candidates. Maximal degree in co-relation 2098. Up to 221 conditions per place. [2022-11-16 11:01:38,346 INFO L137 encePairwiseOnDemand]: 108/121 looper letters, 27 selfloop transitions, 16 changer transitions 28/152 dead transitions. [2022-11-16 11:01:38,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 152 transitions, 801 flow [2022-11-16 11:01:38,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:01:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:01:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1396 transitions. [2022-11-16 11:01:38,352 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8240850059031877 [2022-11-16 11:01:38,352 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1396 transitions. [2022-11-16 11:01:38,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1396 transitions. [2022-11-16 11:01:38,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:38,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1396 transitions. [2022-11-16 11:01:38,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 99.71428571428571) internal successors, (1396), 14 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:38,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:38,364 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:38,364 INFO L175 Difference]: Start difference. First operand has 131 places, 109 transitions, 309 flow. Second operand 14 states and 1396 transitions. [2022-11-16 11:01:38,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 152 transitions, 801 flow [2022-11-16 11:01:38,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 152 transitions, 777 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-11-16 11:01:38,371 INFO L231 Difference]: Finished difference. Result has 139 places, 114 transitions, 415 flow [2022-11-16 11:01:38,372 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=415, PETRI_PLACES=139, PETRI_TRANSITIONS=114} [2022-11-16 11:01:38,373 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 13 predicate places. [2022-11-16 11:01:38,373 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 114 transitions, 415 flow [2022-11-16 11:01:38,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 96.41666666666667) internal successors, (1157), 12 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:38,374 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:38,375 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:38,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:01:38,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1560157442, now seen corresponding path program 1 times [2022-11-16 11:01:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:38,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461893519] [2022-11-16 11:01:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:38,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461893519] [2022-11-16 11:01:38,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461893519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:38,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:38,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:01:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045331702] [2022-11-16 11:01:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:38,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:01:38,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:38,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:01:38,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:01:38,799 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-16 11:01:38,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 114 transitions, 415 flow. Second operand has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:38,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:38,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-16 11:01:38,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:39,548 INFO L130 PetriNetUnfolder]: 938/2032 cut-off events. [2022-11-16 11:01:39,548 INFO L131 PetriNetUnfolder]: For 12787/12807 co-relation queries the response was YES. [2022-11-16 11:01:39,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 2032 events. 938/2032 cut-off events. For 12787/12807 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13978 event pairs, 55 based on Foata normal form. 8/1992 useless extension candidates. Maximal degree in co-relation 6859. Up to 551 conditions per place. [2022-11-16 11:01:39,571 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 52 selfloop transitions, 13 changer transitions 43/194 dead transitions. [2022-11-16 11:01:39,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 194 transitions, 1183 flow [2022-11-16 11:01:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:01:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:01:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1052 transitions. [2022-11-16 11:01:39,575 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8694214876033057 [2022-11-16 11:01:39,575 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1052 transitions. [2022-11-16 11:01:39,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1052 transitions. [2022-11-16 11:01:39,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:39,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1052 transitions. [2022-11-16 11:01:39,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.2) internal successors, (1052), 10 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:39,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:39,584 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:39,584 INFO L175 Difference]: Start difference. First operand has 139 places, 114 transitions, 415 flow. Second operand 10 states and 1052 transitions. [2022-11-16 11:01:39,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 194 transitions, 1183 flow [2022-11-16 11:01:39,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 194 transitions, 1008 flow, removed 85 selfloop flow, removed 9 redundant places. [2022-11-16 11:01:39,597 INFO L231 Difference]: Finished difference. Result has 139 places, 123 transitions, 444 flow [2022-11-16 11:01:39,597 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=444, PETRI_PLACES=139, PETRI_TRANSITIONS=123} [2022-11-16 11:01:39,598 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 13 predicate places. [2022-11-16 11:01:39,599 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 123 transitions, 444 flow [2022-11-16 11:01:39,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:39,599 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:39,600 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:39,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:01:39,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1504790109, now seen corresponding path program 1 times [2022-11-16 11:01:39,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:39,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475543053] [2022-11-16 11:01:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:39,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:39,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475543053] [2022-11-16 11:01:39,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475543053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:39,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:39,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:01:39,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51921141] [2022-11-16 11:01:39,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:39,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:01:39,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:39,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:01:39,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:01:39,962 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-16 11:01:39,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 123 transitions, 444 flow. Second operand has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:39,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:39,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-16 11:01:39,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:40,800 INFO L130 PetriNetUnfolder]: 760/1831 cut-off events. [2022-11-16 11:01:40,801 INFO L131 PetriNetUnfolder]: For 6498/6526 co-relation queries the response was YES. [2022-11-16 11:01:40,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6265 conditions, 1831 events. 760/1831 cut-off events. For 6498/6526 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13502 event pairs, 45 based on Foata normal form. 46/1864 useless extension candidates. Maximal degree in co-relation 6190. Up to 305 conditions per place. [2022-11-16 11:01:40,820 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 61 selfloop transitions, 24 changer transitions 48/219 dead transitions. [2022-11-16 11:01:40,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 219 transitions, 1397 flow [2022-11-16 11:01:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:01:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:01:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1366 transitions. [2022-11-16 11:01:40,826 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8684043229497775 [2022-11-16 11:01:40,826 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1366 transitions. [2022-11-16 11:01:40,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1366 transitions. [2022-11-16 11:01:40,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:40,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1366 transitions. [2022-11-16 11:01:40,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 105.07692307692308) internal successors, (1366), 13 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:40,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:40,837 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:40,838 INFO L175 Difference]: Start difference. First operand has 139 places, 123 transitions, 444 flow. Second operand 13 states and 1366 transitions. [2022-11-16 11:01:40,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 219 transitions, 1397 flow [2022-11-16 11:01:40,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 219 transitions, 1393 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-16 11:01:40,853 INFO L231 Difference]: Finished difference. Result has 156 places, 138 transitions, 644 flow [2022-11-16 11:01:40,854 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=644, PETRI_PLACES=156, PETRI_TRANSITIONS=138} [2022-11-16 11:01:40,855 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 30 predicate places. [2022-11-16 11:01:40,855 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 138 transitions, 644 flow [2022-11-16 11:01:40,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:40,856 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:40,856 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:40,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:01:40,857 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2037801635, now seen corresponding path program 1 times [2022-11-16 11:01:40,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:40,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802809896] [2022-11-16 11:01:40,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:40,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:41,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:41,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802809896] [2022-11-16 11:01:41,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802809896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:41,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:41,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:01:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499411200] [2022-11-16 11:01:41,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:41,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:01:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:41,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:01:41,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:01:41,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-16 11:01:41,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 138 transitions, 644 flow. Second operand has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:41,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:41,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-16 11:01:41,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:41,943 INFO L130 PetriNetUnfolder]: 285/1484 cut-off events. [2022-11-16 11:01:41,943 INFO L131 PetriNetUnfolder]: For 4184/4662 co-relation queries the response was YES. [2022-11-16 11:01:41,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4676 conditions, 1484 events. 285/1484 cut-off events. For 4184/4662 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 13643 event pairs, 31 based on Foata normal form. 12/1419 useless extension candidates. Maximal degree in co-relation 4592. Up to 274 conditions per place. [2022-11-16 11:01:41,962 INFO L137 encePairwiseOnDemand]: 115/121 looper letters, 40 selfloop transitions, 2 changer transitions 14/169 dead transitions. [2022-11-16 11:01:41,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 169 transitions, 964 flow [2022-11-16 11:01:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:01:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:01:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 726 transitions. [2022-11-16 11:01:41,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-11-16 11:01:41,966 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 726 transitions. [2022-11-16 11:01:41,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 726 transitions. [2022-11-16 11:01:41,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:41,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 726 transitions. [2022-11-16 11:01:41,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:41,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:41,976 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:41,976 INFO L175 Difference]: Start difference. First operand has 156 places, 138 transitions, 644 flow. Second operand 7 states and 726 transitions. [2022-11-16 11:01:41,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 169 transitions, 964 flow [2022-11-16 11:01:42,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 169 transitions, 906 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-11-16 11:01:42,030 INFO L231 Difference]: Finished difference. Result has 163 places, 139 transitions, 605 flow [2022-11-16 11:01:42,031 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=605, PETRI_PLACES=163, PETRI_TRANSITIONS=139} [2022-11-16 11:01:42,034 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 37 predicate places. [2022-11-16 11:01:42,035 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 139 transitions, 605 flow [2022-11-16 11:01:42,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:42,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:42,036 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:42,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:01:42,037 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:42,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1165921067, now seen corresponding path program 2 times [2022-11-16 11:01:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:42,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997509429] [2022-11-16 11:01:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:42,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:42,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997509429] [2022-11-16 11:01:42,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997509429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:42,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:42,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:01:42,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920268330] [2022-11-16 11:01:42,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:42,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:01:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:01:42,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:01:42,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-16 11:01:42,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 139 transitions, 605 flow. Second operand has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:42,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:42,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-16 11:01:42,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:43,675 INFO L130 PetriNetUnfolder]: 1076/2785 cut-off events. [2022-11-16 11:01:43,675 INFO L131 PetriNetUnfolder]: For 11009/11267 co-relation queries the response was YES. [2022-11-16 11:01:43,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10118 conditions, 2785 events. 1076/2785 cut-off events. For 11009/11267 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24290 event pairs, 80 based on Foata normal form. 36/2770 useless extension candidates. Maximal degree in co-relation 10086. Up to 492 conditions per place. [2022-11-16 11:01:43,703 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 38 selfloop transitions, 22 changer transitions 71/216 dead transitions. [2022-11-16 11:01:43,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 216 transitions, 1418 flow [2022-11-16 11:01:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:01:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:01:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1646 transitions. [2022-11-16 11:01:43,709 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8502066115702479 [2022-11-16 11:01:43,709 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1646 transitions. [2022-11-16 11:01:43,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1646 transitions. [2022-11-16 11:01:43,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:43,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1646 transitions. [2022-11-16 11:01:43,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 102.875) internal successors, (1646), 16 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:43,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:43,723 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:43,723 INFO L175 Difference]: Start difference. First operand has 163 places, 139 transitions, 605 flow. Second operand 16 states and 1646 transitions. [2022-11-16 11:01:43,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 216 transitions, 1418 flow [2022-11-16 11:01:43,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 216 transitions, 1391 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-11-16 11:01:43,798 INFO L231 Difference]: Finished difference. Result has 176 places, 128 transitions, 580 flow [2022-11-16 11:01:43,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=580, PETRI_PLACES=176, PETRI_TRANSITIONS=128} [2022-11-16 11:01:43,800 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 50 predicate places. [2022-11-16 11:01:43,800 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 128 transitions, 580 flow [2022-11-16 11:01:43,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:43,801 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:43,801 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:43,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:01:43,802 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:43,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1767754806, now seen corresponding path program 1 times [2022-11-16 11:01:43,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:43,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344873865] [2022-11-16 11:01:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:43,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:01:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:01:44,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344873865] [2022-11-16 11:01:44,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344873865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:44,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:44,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 11:01:44,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830152544] [2022-11-16 11:01:44,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:44,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:01:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:01:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:01:44,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:01:44,920 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 121 [2022-11-16 11:01:44,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 128 transitions, 580 flow. Second operand has 13 states, 13 states have (on average 84.61538461538461) internal successors, (1100), 13 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:44,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:01:44,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 121 [2022-11-16 11:01:44,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:01:45,951 INFO L130 PetriNetUnfolder]: 429/2360 cut-off events. [2022-11-16 11:01:45,952 INFO L131 PetriNetUnfolder]: For 6024/6149 co-relation queries the response was YES. [2022-11-16 11:01:45,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7295 conditions, 2360 events. 429/2360 cut-off events. For 6024/6149 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 25462 event pairs, 29 based on Foata normal form. 3/2223 useless extension candidates. Maximal degree in co-relation 7203. Up to 317 conditions per place. [2022-11-16 11:01:45,985 INFO L137 encePairwiseOnDemand]: 105/121 looper letters, 33 selfloop transitions, 9 changer transitions 46/176 dead transitions. [2022-11-16 11:01:45,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 176 transitions, 1009 flow [2022-11-16 11:01:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:01:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 11:01:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1307 transitions. [2022-11-16 11:01:45,991 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7201101928374656 [2022-11-16 11:01:45,992 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1307 transitions. [2022-11-16 11:01:45,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1307 transitions. [2022-11-16 11:01:45,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:01:45,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1307 transitions. [2022-11-16 11:01:45,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 87.13333333333334) internal successors, (1307), 15 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:46,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:46,003 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:46,003 INFO L175 Difference]: Start difference. First operand has 176 places, 128 transitions, 580 flow. Second operand 15 states and 1307 transitions. [2022-11-16 11:01:46,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 176 transitions, 1009 flow [2022-11-16 11:01:46,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 176 transitions, 813 flow, removed 57 selfloop flow, removed 23 redundant places. [2022-11-16 11:01:46,087 INFO L231 Difference]: Finished difference. Result has 166 places, 125 transitions, 481 flow [2022-11-16 11:01:46,088 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=481, PETRI_PLACES=166, PETRI_TRANSITIONS=125} [2022-11-16 11:01:46,089 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 40 predicate places. [2022-11-16 11:01:46,090 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 125 transitions, 481 flow [2022-11-16 11:01:46,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 84.61538461538461) internal successors, (1100), 13 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:46,091 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:01:46,091 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:46,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:01:46,092 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:01:46,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:46,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2084871160, now seen corresponding path program 2 times [2022-11-16 11:01:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:01:46,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434951680] [2022-11-16 11:01:46,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:46,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:01:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:01:46,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:01:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:01:46,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:01:46,302 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:01:46,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 11:01:46,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 11:01:46,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 11:01:46,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 11:01:46,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 11:01:46,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 11:01:46,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:01:46,308 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-16 11:01:46,316 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:01:46,317 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:01:46,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:01:46 BasicIcfg [2022-11-16 11:01:46,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:01:46,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:01:46,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:01:46,494 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:01:46,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:01:29" (3/4) ... [2022-11-16 11:01:46,497 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:01:46,613 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:01:46,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:01:46,614 INFO L158 Benchmark]: Toolchain (without parser) took 18872.78ms. Allocated memory was 86.0MB in the beginning and 323.0MB in the end (delta: 237.0MB). Free memory was 50.2MB in the beginning and 107.9MB in the end (delta: -57.7MB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. [2022-11-16 11:01:46,614 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 86.0MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:01:46,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 780.79ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 49.9MB in the beginning and 96.9MB in the end (delta: -47.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-11-16 11:01:46,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.57ms. Allocated memory is still 130.0MB. Free memory was 96.9MB in the beginning and 94.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:01:46,616 INFO L158 Benchmark]: Boogie Preprocessor took 62.39ms. Allocated memory is still 130.0MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:01:46,618 INFO L158 Benchmark]: RCFGBuilder took 1049.33ms. Allocated memory is still 130.0MB. Free memory was 92.2MB in the beginning and 58.1MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-16 11:01:46,618 INFO L158 Benchmark]: TraceAbstraction took 16735.32ms. Allocated memory was 130.0MB in the beginning and 323.0MB in the end (delta: 192.9MB). Free memory was 57.2MB in the beginning and 134.1MB in the end (delta: -76.9MB). Peak memory consumption was 114.5MB. Max. memory is 16.1GB. [2022-11-16 11:01:46,619 INFO L158 Benchmark]: Witness Printer took 119.54ms. Allocated memory is still 323.0MB. Free memory was 134.1MB in the beginning and 107.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-16 11:01:46,621 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 86.0MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 780.79ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 49.9MB in the beginning and 96.9MB in the end (delta: -47.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.57ms. Allocated memory is still 130.0MB. Free memory was 96.9MB in the beginning and 94.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.39ms. Allocated memory is still 130.0MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1049.33ms. Allocated memory is still 130.0MB. Free memory was 92.2MB in the beginning and 58.1MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16735.32ms. Allocated memory was 130.0MB in the beginning and 323.0MB in the end (delta: 192.9MB). Free memory was 57.2MB in the beginning and 134.1MB in the end (delta: -76.9MB). Peak memory consumption was 114.5MB. Max. memory is 16.1GB. * Witness Printer took 119.54ms. Allocated memory is still 323.0MB. Free memory was 134.1MB in the beginning and 107.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L724] 0 _Bool x$flush_delayed; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0] [L735] 0 int *x$read_delayed_var; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L725] 0 int x$mem_tmp; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L729] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L727] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L728] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L726] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L719] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L734] 0 _Bool x$read_delayed; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L739] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L737] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L736] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L738] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t299; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299, ((void *)0), P0, ((void *)0))=-2, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t300; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300, ((void *)0), P1, ((void *)0))=-1, t299={5:0}, t300={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L839] 0 pthread_t t301; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t301, ((void *)0), P2, ((void *)0))=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 750 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 750 mSDsluCounter, 619 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1315 IncrementalHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 124 mSDtfsCounter, 1315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred in iteration=7, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, 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: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 923 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 818 ConstructedInterpolants, 0 QuantifiedInterpolants, 3810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 11:01:46,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05f33c5-bf0b-44da-95fd-19c521784de7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE