./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:20:46,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:20:46,311 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:20:46,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:20:46,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:20:46,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:20:46,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:20:46,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:20:46,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:20:46,346 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:20:46,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:20:46,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:20:46,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:20:46,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:20:46,349 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:20:46,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:20:46,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:20:46,351 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:20:46,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:20:46,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:20:46,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:20:46,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:20:46,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:20:46,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:20:46,355 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:20:46,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:20:46,356 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:20:46,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:20:46,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:20:46,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:20:46,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:20:46,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:20:46,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:20:46,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:20:46,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:20:46,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:20:46,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:20:46,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:20:46,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:20:46,362 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:20:46,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:20:46,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:20:46,364 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/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_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 [2023-11-21 22:20:46,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:20:46,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:20:46,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:20:46,678 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:20:46,679 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:20:46,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2023-11-21 22:20:49,907 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:20:50,300 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:20:50,301 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2023-11-21 22:20:50,334 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/data/80a6783dd/0e3ff86d5010487e9df04af4bb5d3d0b/FLAGdb99637b3 [2023-11-21 22:20:50,351 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/data/80a6783dd/0e3ff86d5010487e9df04af4bb5d3d0b [2023-11-21 22:20:50,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:20:50,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:20:50,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:20:50,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:20:50,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:20:50,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:20:50" (1/1) ... [2023-11-21 22:20:50,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c727326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:50, skipping insertion in model container [2023-11-21 22:20:50,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:20:50" (1/1) ... [2023-11-21 22:20:50,446 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:20:50,629 WARN L240 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_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i[995,1008] [2023-11-21 22:20:50,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:20:50,885 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:20:50,898 WARN L240 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_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i[995,1008] [2023-11-21 22:20:50,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:20:51,046 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:20:51,046 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:20:51,054 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:20:51,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51 WrapperNode [2023-11-21 22:20:51,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:20:51,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:20:51,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:20:51,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:20:51,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,129 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 184 [2023-11-21 22:20:51,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:20:51,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:20:51,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:20:51,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:20:51,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,148 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,175 INFO L187 HeapSplitter]: Split 30 memory accesses to 6 slices as follows [2, 1, 24, 1, 1, 1] [2023-11-21 22:20:51,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:20:51,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:20:51,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:20:51,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:20:51,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (1/1) ... [2023-11-21 22:20:51,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:20:51,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:20:51,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:20:51,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:20:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:20:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:20:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 22:20:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-21 22:20:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-21 22:20:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-21 22:20:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:20:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:20:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 22:20:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 22:20:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-21 22:20:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-21 22:20:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:20:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:20:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:20:51,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:20:51,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:20:51,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:20:51,319 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:20:51,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:20:51,320 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:20:51,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:20:51,320 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-21 22:20:51,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-21 22:20:51,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:20:51,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:20:51,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 22:20:51,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-21 22:20:51,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-21 22:20:51,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-21 22:20:51,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:20:51,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:20:51,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:20:51,324 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:20:51,527 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:20:51,530 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:20:52,124 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:20:52,671 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:20:52,672 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:20:52,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:20:52 BoogieIcfgContainer [2023-11-21 22:20:52,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:20:52,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:20:52,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:20:52,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:20:52,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:20:50" (1/3) ... [2023-11-21 22:20:52,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c61769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:20:52, skipping insertion in model container [2023-11-21 22:20:52,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:51" (2/3) ... [2023-11-21 22:20:52,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c61769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:20:52, skipping insertion in model container [2023-11-21 22:20:52,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:20:52" (3/3) ... [2023-11-21 22:20:52,685 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2023-11-21 22:20:52,695 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:20:52,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:20:52,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 22:20:52,707 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:20:52,785 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:20:52,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2023-11-21 22:20:52,886 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-21 22:20:52,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:20:52,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2023-11-21 22:20:52,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2023-11-21 22:20:52,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2023-11-21 22:20:52,921 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:20:52,927 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=LoopHeads, 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;@7db839ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:20:52,927 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-21 22:20:52,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:20:52,955 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2023-11-21 22:20:52,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:20:52,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:20:52,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:52,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:20:52,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:52,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1626392974, now seen corresponding path program 1 times [2023-11-21 22:20:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:52,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859750925] [2023-11-21 22:20:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:52,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:53,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859750925] [2023-11-21 22:20:53,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859750925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:53,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:20:53,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711103519] [2023-11-21 22:20:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:53,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:20:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:54,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:20:54,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:20:54,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2023-11-21 22:20:54,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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) [2023-11-21 22:20:54,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:20:54,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2023-11-21 22:20:54,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:20:55,610 INFO L124 PetriNetUnfolderBase]: 2645/4042 cut-off events. [2023-11-21 22:20:55,610 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-21 22:20:55,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7860 conditions, 4042 events. 2645/4042 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 26440 event pairs, 715 based on Foata normal form. 120/4129 useless extension candidates. Maximal degree in co-relation 7848. Up to 2617 conditions per place. [2023-11-21 22:20:55,651 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 33 selfloop transitions, 2 changer transitions 35/84 dead transitions. [2023-11-21 22:20:55,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 323 flow [2023-11-21 22:20:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:20:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:20:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2023-11-21 22:20:55,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2023-11-21 22:20:55,667 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 198 transitions. [2023-11-21 22:20:55,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 198 transitions. [2023-11-21 22:20:55,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:20:55,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 198 transitions. [2023-11-21 22:20:55,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 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) [2023-11-21 22:20:55,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-21 22:20:55,679 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-21 22:20:55,682 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 7 states and 198 transitions. [2023-11-21 22:20:55,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 323 flow [2023-11-21 22:20:55,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 318 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 22:20:55,690 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 100 flow [2023-11-21 22:20:55,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=100, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2023-11-21 22:20:55,696 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-11-21 22:20:55,696 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 100 flow [2023-11-21 22:20:55,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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) [2023-11-21 22:20:55,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:20:55,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:55,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:20:55,698 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:20:55,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:55,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1180637533, now seen corresponding path program 1 times [2023-11-21 22:20:55,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:55,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867448252] [2023-11-21 22:20:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:55,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:56,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867448252] [2023-11-21 22:20:56,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867448252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:56,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:56,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:20:56,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207263058] [2023-11-21 22:20:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:56,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:20:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:20:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:20:56,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2023-11-21 22:20:56,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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) [2023-11-21 22:20:56,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:20:56,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2023-11-21 22:20:56,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:20:58,619 INFO L124 PetriNetUnfolderBase]: 4721/7417 cut-off events. [2023-11-21 22:20:58,620 INFO L125 PetriNetUnfolderBase]: For 810/810 co-relation queries the response was YES. [2023-11-21 22:20:58,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15390 conditions, 7417 events. 4721/7417 cut-off events. For 810/810 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 52702 event pairs, 741 based on Foata normal form. 144/7516 useless extension candidates. Maximal degree in co-relation 15375. Up to 2617 conditions per place. [2023-11-21 22:20:58,681 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 3 changer transitions 47/108 dead transitions. [2023-11-21 22:20:58,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 451 flow [2023-11-21 22:20:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:20:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:20:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2023-11-21 22:20:58,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6472222222222223 [2023-11-21 22:20:58,696 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 233 transitions. [2023-11-21 22:20:58,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 233 transitions. [2023-11-21 22:20:58,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:20:58,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 233 transitions. [2023-11-21 22:20:58,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 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) [2023-11-21 22:20:58,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 45.0) internal successors, (405), 9 states have internal predecessors, (405), 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) [2023-11-21 22:20:58,705 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 45.0) internal successors, (405), 9 states have internal predecessors, (405), 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) [2023-11-21 22:20:58,705 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 100 flow. Second operand 8 states and 233 transitions. [2023-11-21 22:20:58,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 451 flow [2023-11-21 22:20:58,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 108 transitions, 429 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-21 22:20:58,819 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 110 flow [2023-11-21 22:20:58,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-11-21 22:20:58,820 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-11-21 22:20:58,821 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 110 flow [2023-11-21 22:20:58,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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) [2023-11-21 22:20:58,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:20:58,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:58,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:20:58,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:20:58,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1561733660, now seen corresponding path program 1 times [2023-11-21 22:20:58,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:58,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346419495] [2023-11-21 22:20:58,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:58,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346419495] [2023-11-21 22:20:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346419495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:59,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:59,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:20:59,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595485932] [2023-11-21 22:20:59,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:59,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:20:59,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:59,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:20:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:20:59,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2023-11-21 22:20:59,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2023-11-21 22:20:59,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:20:59,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2023-11-21 22:20:59,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:00,541 INFO L124 PetriNetUnfolderBase]: 1967/3569 cut-off events. [2023-11-21 22:21:00,541 INFO L125 PetriNetUnfolderBase]: For 1065/1077 co-relation queries the response was YES. [2023-11-21 22:21:00,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7194 conditions, 3569 events. 1967/3569 cut-off events. For 1065/1077 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 26023 event pairs, 343 based on Foata normal form. 96/3582 useless extension candidates. Maximal degree in co-relation 7177. Up to 1765 conditions per place. [2023-11-21 22:21:00,577 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 37 selfloop transitions, 2 changer transitions 35/89 dead transitions. [2023-11-21 22:21:00,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 380 flow [2023-11-21 22:21:00,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:21:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:21:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2023-11-21 22:21:00,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6634920634920635 [2023-11-21 22:21:00,579 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 209 transitions. [2023-11-21 22:21:00,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 209 transitions. [2023-11-21 22:21:00,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:00,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 209 transitions. [2023-11-21 22:21:00,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 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) [2023-11-21 22:21:00,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-21 22:21:00,582 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-21 22:21:00,583 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 110 flow. Second operand 7 states and 209 transitions. [2023-11-21 22:21:00,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 380 flow [2023-11-21 22:21:00,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 348 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-11-21 22:21:00,626 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 106 flow [2023-11-21 22:21:00,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2023-11-21 22:21:00,630 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-11-21 22:21:00,630 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 106 flow [2023-11-21 22:21:00,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2023-11-21 22:21:00,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:00,631 INFO L208 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] [2023-11-21 22:21:00,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:21:00,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:21:00,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 97844437, now seen corresponding path program 1 times [2023-11-21 22:21:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395965123] [2023-11-21 22:21:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395965123] [2023-11-21 22:21:02,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395965123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:02,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:02,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:21:02,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878649853] [2023-11-21 22:21:02,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:02,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:02,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:02,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2023-11-21 22:21:02,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 38 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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) [2023-11-21 22:21:02,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:02,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2023-11-21 22:21:02,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:03,724 INFO L124 PetriNetUnfolderBase]: 1743/2774 cut-off events. [2023-11-21 22:21:03,724 INFO L125 PetriNetUnfolderBase]: For 822/822 co-relation queries the response was YES. [2023-11-21 22:21:03,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6159 conditions, 2774 events. 1743/2774 cut-off events. For 822/822 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17849 event pairs, 475 based on Foata normal form. 64/2802 useless extension candidates. Maximal degree in co-relation 6143. Up to 2005 conditions per place. [2023-11-21 22:21:03,752 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 30 selfloop transitions, 3 changer transitions 27/75 dead transitions. [2023-11-21 22:21:03,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 317 flow [2023-11-21 22:21:03,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:21:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:21:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2023-11-21 22:21:03,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2023-11-21 22:21:03,754 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 195 transitions. [2023-11-21 22:21:03,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 195 transitions. [2023-11-21 22:21:03,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:03,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 195 transitions. [2023-11-21 22:21:03,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 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) [2023-11-21 22:21:03,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-21 22:21:03,758 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-21 22:21:03,758 INFO L175 Difference]: Start difference. First operand has 60 places, 38 transitions, 106 flow. Second operand 7 states and 195 transitions. [2023-11-21 22:21:03,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 317 flow [2023-11-21 22:21:03,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 295 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-21 22:21:03,772 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 129 flow [2023-11-21 22:21:03,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-11-21 22:21:03,774 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-11-21 22:21:03,774 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 129 flow [2023-11-21 22:21:03,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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) [2023-11-21 22:21:03,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:03,775 INFO L208 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] [2023-11-21 22:21:03,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:21:03,775 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:21:03,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1267674400, now seen corresponding path program 1 times [2023-11-21 22:21:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604211205] [2023-11-21 22:21:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:04,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:04,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604211205] [2023-11-21 22:21:04,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604211205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:04,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:04,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:21:04,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319099696] [2023-11-21 22:21:04,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:04,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:04,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:04,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:04,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2023-11-21 22:21:04,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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) [2023-11-21 22:21:04,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:04,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2023-11-21 22:21:04,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:05,418 INFO L124 PetriNetUnfolderBase]: 2018/3141 cut-off events. [2023-11-21 22:21:05,419 INFO L125 PetriNetUnfolderBase]: For 1810/1810 co-relation queries the response was YES. [2023-11-21 22:21:05,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7798 conditions, 3141 events. 2018/3141 cut-off events. For 1810/1810 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 20485 event pairs, 1234 based on Foata normal form. 48/3085 useless extension candidates. Maximal degree in co-relation 7781. Up to 2193 conditions per place. [2023-11-21 22:21:05,455 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 31 selfloop transitions, 8 changer transitions 16/70 dead transitions. [2023-11-21 22:21:05,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 338 flow [2023-11-21 22:21:05,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:21:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:21:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2023-11-21 22:21:05,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2023-11-21 22:21:05,457 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 168 transitions. [2023-11-21 22:21:05,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 168 transitions. [2023-11-21 22:21:05,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:05,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 168 transitions. [2023-11-21 22:21:05,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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) [2023-11-21 22:21:05,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 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) [2023-11-21 22:21:05,460 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 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) [2023-11-21 22:21:05,460 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 129 flow. Second operand 6 states and 168 transitions. [2023-11-21 22:21:05,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 338 flow [2023-11-21 22:21:05,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 325 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-21 22:21:05,473 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 178 flow [2023-11-21 22:21:05,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-11-21 22:21:05,476 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-11-21 22:21:05,477 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 178 flow [2023-11-21 22:21:05,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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) [2023-11-21 22:21:05,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:05,477 INFO L208 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] [2023-11-21 22:21:05,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:21:05,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:21:05,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:05,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1531573550, now seen corresponding path program 2 times [2023-11-21 22:21:05,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:05,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552789988] [2023-11-21 22:21:05,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:05,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552789988] [2023-11-21 22:21:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552789988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:06,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:06,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:06,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352494811] [2023-11-21 22:21:06,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:06,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:21:06,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:06,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:21:06,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:21:06,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2023-11-21 22:21:06,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 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) [2023-11-21 22:21:06,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:06,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2023-11-21 22:21:06,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:07,602 INFO L124 PetriNetUnfolderBase]: 2735/4320 cut-off events. [2023-11-21 22:21:07,603 INFO L125 PetriNetUnfolderBase]: For 3560/3560 co-relation queries the response was YES. [2023-11-21 22:21:07,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11920 conditions, 4320 events. 2735/4320 cut-off events. For 3560/3560 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 30182 event pairs, 801 based on Foata normal form. 84/4316 useless extension candidates. Maximal degree in co-relation 11901. Up to 1558 conditions per place. [2023-11-21 22:21:07,675 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 41 selfloop transitions, 10 changer transitions 29/95 dead transitions. [2023-11-21 22:21:07,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 513 flow [2023-11-21 22:21:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:21:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-21 22:21:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 252 transitions. [2023-11-21 22:21:07,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2023-11-21 22:21:07,692 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 252 transitions. [2023-11-21 22:21:07,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 252 transitions. [2023-11-21 22:21:07,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:07,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 252 transitions. [2023-11-21 22:21:07,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 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) [2023-11-21 22:21:07,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 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) [2023-11-21 22:21:07,695 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 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) [2023-11-21 22:21:07,695 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 178 flow. Second operand 9 states and 252 transitions. [2023-11-21 22:21:07,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 513 flow [2023-11-21 22:21:07,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 478 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-11-21 22:21:07,723 INFO L231 Difference]: Finished difference. Result has 69 places, 45 transitions, 197 flow [2023-11-21 22:21:07,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=69, PETRI_TRANSITIONS=45} [2023-11-21 22:21:07,724 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-11-21 22:21:07,724 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 197 flow [2023-11-21 22:21:07,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 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) [2023-11-21 22:21:07,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:07,725 INFO L208 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] [2023-11-21 22:21:07,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:21:07,758 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:21:07,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash 497206932, now seen corresponding path program 1 times [2023-11-21 22:21:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:07,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47136854] [2023-11-21 22:21:07,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:08,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:08,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47136854] [2023-11-21 22:21:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47136854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:08,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:08,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:21:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982583244] [2023-11-21 22:21:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:08,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:21:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:08,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:21:08,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:21:08,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2023-11-21 22:21:08,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 45 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2023-11-21 22:21:08,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:08,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2023-11-21 22:21:08,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:11,074 INFO L124 PetriNetUnfolderBase]: 10513/15243 cut-off events. [2023-11-21 22:21:11,074 INFO L125 PetriNetUnfolderBase]: For 16419/16419 co-relation queries the response was YES. [2023-11-21 22:21:11,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41548 conditions, 15243 events. 10513/15243 cut-off events. For 16419/16419 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 98569 event pairs, 1532 based on Foata normal form. 546/15769 useless extension candidates. Maximal degree in co-relation 41526. Up to 8539 conditions per place. [2023-11-21 22:21:11,170 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 65 selfloop transitions, 6 changer transitions 5/87 dead transitions. [2023-11-21 22:21:11,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 559 flow [2023-11-21 22:21:11,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:21:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:21:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2023-11-21 22:21:11,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2023-11-21 22:21:11,172 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 123 transitions. [2023-11-21 22:21:11,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 123 transitions. [2023-11-21 22:21:11,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:11,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 123 transitions. [2023-11-21 22:21:11,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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) [2023-11-21 22:21:11,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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) [2023-11-21 22:21:11,174 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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) [2023-11-21 22:21:11,174 INFO L175 Difference]: Start difference. First operand has 69 places, 45 transitions, 197 flow. Second operand 4 states and 123 transitions. [2023-11-21 22:21:11,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 559 flow [2023-11-21 22:21:11,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 519 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-21 22:21:11,279 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 219 flow [2023-11-21 22:21:11,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-11-21 22:21:11,280 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-11-21 22:21:11,280 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 219 flow [2023-11-21 22:21:11,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2023-11-21 22:21:11,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:11,281 INFO L208 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] [2023-11-21 22:21:11,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:21:11,281 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:21:11,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash -727429389, now seen corresponding path program 1 times [2023-11-21 22:21:11,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:11,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668293622] [2023-11-21 22:21:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:11,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:11,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668293622] [2023-11-21 22:21:11,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668293622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:11,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:11,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:21:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197535473] [2023-11-21 22:21:11,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:11,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:21:11,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:11,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:21:11,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:11,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2023-11-21 22:21:11,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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) [2023-11-21 22:21:11,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:11,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2023-11-21 22:21:11,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:13,631 INFO L124 PetriNetUnfolderBase]: 8559/12499 cut-off events. [2023-11-21 22:21:13,631 INFO L125 PetriNetUnfolderBase]: For 12611/12616 co-relation queries the response was YES. [2023-11-21 22:21:13,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36842 conditions, 12499 events. 8559/12499 cut-off events. For 12611/12616 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 77253 event pairs, 627 based on Foata normal form. 518/12997 useless extension candidates. Maximal degree in co-relation 36821. Up to 5985 conditions per place. [2023-11-21 22:21:13,702 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 81 selfloop transitions, 10 changer transitions 9/111 dead transitions. [2023-11-21 22:21:13,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 111 transitions, 722 flow [2023-11-21 22:21:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:21:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:21:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2023-11-21 22:21:13,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6977777777777778 [2023-11-21 22:21:13,705 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 157 transitions. [2023-11-21 22:21:13,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 157 transitions. [2023-11-21 22:21:13,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:13,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 157 transitions. [2023-11-21 22:21:13,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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) [2023-11-21 22:21:13,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 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) [2023-11-21 22:21:13,710 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 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) [2023-11-21 22:21:13,710 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 219 flow. Second operand 5 states and 157 transitions. [2023-11-21 22:21:13,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 111 transitions, 722 flow [2023-11-21 22:21:13,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 111 transitions, 711 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:13,727 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 271 flow [2023-11-21 22:21:13,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2023-11-21 22:21:13,730 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-11-21 22:21:13,730 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 271 flow [2023-11-21 22:21:13,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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) [2023-11-21 22:21:13,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:13,731 INFO L208 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] [2023-11-21 22:21:13,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:21:13,731 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:21:13,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1060940234, now seen corresponding path program 1 times [2023-11-21 22:21:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:13,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999822170] [2023-11-21 22:21:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:14,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:14,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999822170] [2023-11-21 22:21:14,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999822170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:14,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:14,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:21:14,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351952912] [2023-11-21 22:21:14,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:14,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:14,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:14,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:14,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2023-11-21 22:21:14,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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) [2023-11-21 22:21:14,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:14,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2023-11-21 22:21:14,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:15,684 INFO L124 PetriNetUnfolderBase]: 5623/8215 cut-off events. [2023-11-21 22:21:15,685 INFO L125 PetriNetUnfolderBase]: For 12473/12483 co-relation queries the response was YES. [2023-11-21 22:21:15,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26164 conditions, 8215 events. 5623/8215 cut-off events. For 12473/12483 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 46331 event pairs, 265 based on Foata normal form. 384/8579 useless extension candidates. Maximal degree in co-relation 26141. Up to 2389 conditions per place. [2023-11-21 22:21:15,727 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 87 selfloop transitions, 14 changer transitions 11/123 dead transitions. [2023-11-21 22:21:15,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 123 transitions, 837 flow [2023-11-21 22:21:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:21:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:21:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2023-11-21 22:21:15,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-21 22:21:15,729 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 189 transitions. [2023-11-21 22:21:15,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 189 transitions. [2023-11-21 22:21:15,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:15,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 189 transitions. [2023-11-21 22:21:15,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 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) [2023-11-21 22:21:15,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 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) [2023-11-21 22:21:15,732 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 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) [2023-11-21 22:21:15,732 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 271 flow. Second operand 6 states and 189 transitions. [2023-11-21 22:21:15,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 123 transitions, 837 flow [2023-11-21 22:21:15,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 123 transitions, 807 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-21 22:21:15,777 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 309 flow [2023-11-21 22:21:15,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-11-21 22:21:15,778 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-11-21 22:21:15,778 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 309 flow [2023-11-21 22:21:15,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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) [2023-11-21 22:21:15,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:15,779 INFO L208 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] [2023-11-21 22:21:15,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:21:15,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:21:15,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 766811281, now seen corresponding path program 1 times [2023-11-21 22:21:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:15,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414304573] [2023-11-21 22:21:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:15,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:16,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414304573] [2023-11-21 22:21:16,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414304573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:16,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:16,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754354830] [2023-11-21 22:21:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:16,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:21:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:16,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:21:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:21:16,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2023-11-21 22:21:16,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 309 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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) [2023-11-21 22:21:16,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:16,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2023-11-21 22:21:16,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:17,063 INFO L124 PetriNetUnfolderBase]: 3628/5230 cut-off events. [2023-11-21 22:21:17,064 INFO L125 PetriNetUnfolderBase]: For 10979/10989 co-relation queries the response was YES. [2023-11-21 22:21:17,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17901 conditions, 5230 events. 3628/5230 cut-off events. For 10979/10989 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 27273 event pairs, 138 based on Foata normal form. 172/5380 useless extension candidates. Maximal degree in co-relation 17877. Up to 1680 conditions per place. [2023-11-21 22:21:17,102 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 75 selfloop transitions, 18 changer transitions 10/114 dead transitions. [2023-11-21 22:21:17,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 768 flow [2023-11-21 22:21:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:21:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:21:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2023-11-21 22:21:17,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2023-11-21 22:21:17,105 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 201 transitions. [2023-11-21 22:21:17,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 201 transitions. [2023-11-21 22:21:17,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:17,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 201 transitions. [2023-11-21 22:21:17,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 28.714285714285715) internal successors, (201), 7 states have internal predecessors, (201), 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) [2023-11-21 22:21:17,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-21 22:21:17,108 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-21 22:21:17,108 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 309 flow. Second operand 7 states and 201 transitions. [2023-11-21 22:21:17,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 768 flow [2023-11-21 22:21:17,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 114 transitions, 682 flow, removed 24 selfloop flow, removed 9 redundant places. [2023-11-21 22:21:17,208 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 282 flow [2023-11-21 22:21:17,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2023-11-21 22:21:17,209 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-11-21 22:21:17,209 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 282 flow [2023-11-21 22:21:17,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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) [2023-11-21 22:21:17,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:17,210 INFO L208 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] [2023-11-21 22:21:17,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:21:17,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:21:17,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1396670927, now seen corresponding path program 1 times [2023-11-21 22:21:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381444101] [2023-11-21 22:21:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381444101] [2023-11-21 22:21:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381444101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986528921] [2023-11-21 22:21:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:17,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:17,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2023-11-21 22:21:17,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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) [2023-11-21 22:21:17,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:17,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2023-11-21 22:21:17,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:18,367 INFO L124 PetriNetUnfolderBase]: 1990/3394 cut-off events. [2023-11-21 22:21:18,367 INFO L125 PetriNetUnfolderBase]: For 3245/3357 co-relation queries the response was YES. [2023-11-21 22:21:18,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9459 conditions, 3394 events. 1990/3394 cut-off events. For 3245/3357 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20659 event pairs, 577 based on Foata normal form. 16/3233 useless extension candidates. Maximal degree in co-relation 9438. Up to 1470 conditions per place. [2023-11-21 22:21:18,382 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 32 selfloop transitions, 1 changer transitions 30/88 dead transitions. [2023-11-21 22:21:18,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 88 transitions, 524 flow [2023-11-21 22:21:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:21:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:21:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2023-11-21 22:21:18,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5962962962962963 [2023-11-21 22:21:18,385 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 161 transitions. [2023-11-21 22:21:18,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 161 transitions. [2023-11-21 22:21:18,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:18,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 161 transitions. [2023-11-21 22:21:18,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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) [2023-11-21 22:21:18,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 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) [2023-11-21 22:21:18,388 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 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) [2023-11-21 22:21:18,388 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 282 flow. Second operand 6 states and 161 transitions. [2023-11-21 22:21:18,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 88 transitions, 524 flow [2023-11-21 22:21:18,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 403 flow, removed 24 selfloop flow, removed 12 redundant places. [2023-11-21 22:21:18,418 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 183 flow [2023-11-21 22:21:18,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-11-21 22:21:18,418 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-11-21 22:21:18,419 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 183 flow [2023-11-21 22:21:18,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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) [2023-11-21 22:21:18,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:18,419 INFO L208 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] [2023-11-21 22:21:18,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:21:18,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-21 22:21:18,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash -593736527, now seen corresponding path program 2 times [2023-11-21 22:21:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:18,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569385106] [2023-11-21 22:21:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:21:18,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:21:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:21:18,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:21:18,628 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:21:18,629 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-21 22:21:18,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-21 22:21:18,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-21 22:21:18,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-21 22:21:18,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-21 22:21:18,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:21:18,633 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:18,639 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:21:18,640 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:21:18,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-21 22:21:18,741 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-21 22:21:18,746 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-21 22:21:18,755 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated [2023-11-21 22:21:18,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:21:18 BasicIcfg [2023-11-21 22:21:18,813 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:21:18,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:21:18,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:21:18,814 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:21:18,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:20:52" (3/4) ... [2023-11-21 22:21:18,815 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-21 22:21:18,881 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-21 22:21:18,883 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-21 22:21:18,887 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-21 22:21:18,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated [2023-11-21 22:21:18,977 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:21:18,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:21:18,978 INFO L158 Benchmark]: Toolchain (without parser) took 28621.20ms. Allocated memory was 169.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 137.6MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 333.8MB. Max. memory is 16.1GB. [2023-11-21 22:21:18,978 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:21:18,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.06ms. Allocated memory is still 169.9MB. Free memory was 137.6MB in the beginning and 111.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-21 22:21:18,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.49ms. Allocated memory is still 169.9MB. Free memory was 111.4MB in the beginning and 108.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:21:18,979 INFO L158 Benchmark]: Boogie Preprocessor took 108.80ms. Allocated memory is still 169.9MB. Free memory was 108.2MB in the beginning and 103.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 22:21:18,980 INFO L158 Benchmark]: RCFGBuilder took 1434.08ms. Allocated memory is still 169.9MB. Free memory was 103.6MB in the beginning and 108.0MB in the end (delta: -4.4MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2023-11-21 22:21:18,980 INFO L158 Benchmark]: TraceAbstraction took 26135.93ms. Allocated memory was 169.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 107.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 277.6MB. Max. memory is 16.1GB. [2023-11-21 22:21:18,981 INFO L158 Benchmark]: Witness Printer took 163.45ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-21 22:21:18,983 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.06ms. Allocated memory is still 169.9MB. Free memory was 137.6MB in the beginning and 111.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.49ms. Allocated memory is still 169.9MB. Free memory was 111.4MB in the beginning and 108.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.80ms. Allocated memory is still 169.9MB. Free memory was 108.2MB in the beginning and 103.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1434.08ms. Allocated memory is still 169.9MB. Free memory was 103.6MB in the beginning and 108.0MB in the end (delta: -4.4MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26135.93ms. Allocated memory was 169.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 107.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 277.6MB. Max. memory is 16.1GB. * Witness Printer took 163.45ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] EXPR 1 \read(y) [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2226; [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={6:0}, t2226={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={6:0}, t2226={7:0}, t2227={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L860] 0 pthread_t t2228; [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={6:0}, t2226={7:0}, t2227={8:0}, t2228={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 3 y = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 4 y = 2 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={6:0}, t2226={7:0}, t2227={8:0}, t2228={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={6:0}, t2226={7:0}, t2227={8:0}, t2228={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] EXPR 0 \read(y) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={6:0}, t2226={7:0}, t2227={8:0}, t2228={5:0}, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 75 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 795 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 764 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1523 IncrementalHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 39 mSDtfsCounter, 1523 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=9, InterpolantAutomatonStates: 72, 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.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 1354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2023-11-21 22:21:19,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59b4bb55-2637-4ca7-8b2d-02acfe2b41cf/bin/uautomizer-verify-bycVGegfSx/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