./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/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_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/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_000a186e-1ef3-4f8f-a484-ae1f02037603/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 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:03:48,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:03:48,395 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 21:03:48,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:03:48,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:03:48,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:03:48,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:03:48,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:03:48,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 21:03:48,458 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 21:03:48,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:03:48,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:03:48,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:03:48,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:03:48,463 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:03:48,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:03:48,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 21:03:48,464 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:03:48,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:03:48,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:03:48,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:03:48,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 21:03:48,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:03:48,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 21:03:48,468 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:03:48,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:03:48,469 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:03:48,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:03:48,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:03:48,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 21:03:48,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:03:48,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:03:48,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:03:48,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:03:48,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 21:03:48,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:03:48,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:03:48,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:03:48,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 21:03:48,476 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 21:03:48,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 21:03:48,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 21:03:48,477 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_000a186e-1ef3-4f8f-a484-ae1f02037603/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_000a186e-1ef3-4f8f-a484-ae1f02037603/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 -> 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 [2023-11-21 21:03:48,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:03:48,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:03:48,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:03:48,800 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:03:48,800 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:03:48,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/mix008.opt.i [2023-11-21 21:03:52,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:03:52,411 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:03:52,425 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/sv-benchmarks/c/pthread-wmm/mix008.opt.i [2023-11-21 21:03:52,447 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/data/6481f7977/201ae9b4f36e484b9a0c10f127e31988/FLAG217f8f88d [2023-11-21 21:03:52,471 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/data/6481f7977/201ae9b4f36e484b9a0c10f127e31988 [2023-11-21 21:03:52,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:03:52,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:03:52,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:03:52,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:03:52,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:03:52,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:03:52" (1/1) ... [2023-11-21 21:03:52,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef48ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:52, skipping insertion in model container [2023-11-21 21:03:52,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:03:52" (1/1) ... [2023-11-21 21:03:52,544 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:03:52,719 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_000a186e-1ef3-4f8f-a484-ae1f02037603/sv-benchmarks/c/pthread-wmm/mix008.opt.i[944,957] [2023-11-21 21:03:53,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:03:53,064 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:03:53,078 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_000a186e-1ef3-4f8f-a484-ae1f02037603/sv-benchmarks/c/pthread-wmm/mix008.opt.i[944,957] [2023-11-21 21:03:53,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:03:53,204 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:03:53,205 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:03:53,212 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:03:53,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53 WrapperNode [2023-11-21 21:03:53,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:03:53,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:03:53,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:03:53,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:03:53,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,300 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2023-11-21 21:03:53,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:03:53,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:03:53,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:03:53,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:03:53,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,320 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,338 INFO L187 HeapSplitter]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1] [2023-11-21 21:03:53,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:03:53,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:03:53,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:03:53,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:03:53,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (1/1) ... [2023-11-21 21:03:53,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:03:53,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:03:53,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:03:53,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:03:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 21:03:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 21:03:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 21:03:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 21:03:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-21 21:03:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 21:03:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:03:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:03:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:03:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 21:03:53,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 21:03:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 21:03:53,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 21:03:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 21:03:53,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 21:03:53,487 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-21 21:03:53,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-21 21:03:53,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 21:03:53,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 21:03:53,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 21:03:53,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-21 21:03:53,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-21 21:03:53,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 21:03:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:03:53,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:03:53,492 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 21:03:53,749 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:03:53,756 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:03:54,233 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:03:54,598 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:03:54,598 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 21:03:54,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:03:54 BoogieIcfgContainer [2023-11-21 21:03:54,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:03:54,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:03:54,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:03:54,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:03:54,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:03:52" (1/3) ... [2023-11-21 21:03:54,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa7b11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:03:54, skipping insertion in model container [2023-11-21 21:03:54,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:53" (2/3) ... [2023-11-21 21:03:54,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa7b11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:03:54, skipping insertion in model container [2023-11-21 21:03:54,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:03:54" (3/3) ... [2023-11-21 21:03:54,615 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2023-11-21 21:03:54,627 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 21:03:54,639 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:03:54,639 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 21:03:54,639 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 21:03:54,699 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 21:03:54,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-21 21:03:54,780 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-21 21:03:54,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 21:03:54,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-21 21:03:54,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-21 21:03:54,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-21 21:03:54,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 21:03:54,820 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;@51e3ff5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:03:54,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 21:03:54,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 21:03:54,836 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-21 21:03:54,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 21:03:54,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:54,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:54,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:03:54,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2071749537, now seen corresponding path program 1 times [2023-11-21 21:03:54,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:54,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651862350] [2023-11-21 21:03:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:55,444 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 21:03:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651862350] [2023-11-21 21:03:55,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651862350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:55,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 21:03:55,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099640757] [2023-11-21 21:03:55,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:55,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:03:55,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:55,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:55,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:55,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2023-11-21 21:03:55,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 21:03:55,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:55,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2023-11-21 21:03:55,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:56,043 INFO L124 PetriNetUnfolderBase]: 879/1527 cut-off events. [2023-11-21 21:03:56,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 21:03:56,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1527 events. 879/1527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10558 event pairs, 159 based on Foata normal form. 60/1529 useless extension candidates. Maximal degree in co-relation 2835. Up to 1009 conditions per place. [2023-11-21 21:03:56,073 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 26 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-21 21:03:56,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 178 flow [2023-11-21 21:03:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:03:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-21 21:03:56,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.76 [2023-11-21 21:03:56,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-21 21:03:56,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-21 21:03:56,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:56,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-21 21:03:56,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 21:03:56,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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 21:03:56,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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 21:03:56,107 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 114 transitions. [2023-11-21 21:03:56,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 178 flow [2023-11-21 21:03:56,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 21:03:56,119 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2023-11-21 21:03:56,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-21 21:03:56,125 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-21 21:03:56,126 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2023-11-21 21:03:56,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 21:03:56,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:56,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:56,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:03:56,127 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:03:56,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash -157206646, now seen corresponding path program 1 times [2023-11-21 21:03:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068653409] [2023-11-21 21:03:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:56,502 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 21:03:56,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:56,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068653409] [2023-11-21 21:03:56,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068653409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:56,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:56,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280528919] [2023-11-21 21:03:56,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:56,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 21:03:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:56,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:03:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:03:56,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-21 21:03:56,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 21:03:56,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:56,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-21 21:03:56,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:57,752 INFO L124 PetriNetUnfolderBase]: 4037/6466 cut-off events. [2023-11-21 21:03:57,752 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2023-11-21 21:03:57,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12426 conditions, 6466 events. 4037/6466 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 46033 event pairs, 603 based on Foata normal form. 216/6461 useless extension candidates. Maximal degree in co-relation 12416. Up to 3225 conditions per place. [2023-11-21 21:03:57,815 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 46 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2023-11-21 21:03:57,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 270 flow [2023-11-21 21:03:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 21:03:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 21:03:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2023-11-21 21:03:57,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.715 [2023-11-21 21:03:57,827 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 143 transitions. [2023-11-21 21:03:57,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 143 transitions. [2023-11-21 21:03:57,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:57,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 143 transitions. [2023-11-21 21:03:57,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 21:03:57,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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 21:03:57,836 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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 21:03:57,836 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 143 transitions. [2023-11-21 21:03:57,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 270 flow [2023-11-21 21:03:57,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:03:57,844 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2023-11-21 21:03:57,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-21 21:03:57,847 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2023-11-21 21:03:57,847 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2023-11-21 21:03:57,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 21:03:57,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:57,848 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] [2023-11-21 21:03:57,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:03:57,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:03:57,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash 762209700, now seen corresponding path program 1 times [2023-11-21 21:03:57,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:57,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508435943] [2023-11-21 21:03:57,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:58,197 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 21:03:58,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508435943] [2023-11-21 21:03:58,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508435943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:58,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:58,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:03:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042529752] [2023-11-21 21:03:58,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:58,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:03:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:03:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:03:58,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-21 21:03:58,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 21:03:58,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:58,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-21 21:03:58,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:59,331 INFO L124 PetriNetUnfolderBase]: 3433/5500 cut-off events. [2023-11-21 21:03:59,331 INFO L125 PetriNetUnfolderBase]: For 1468/1468 co-relation queries the response was YES. [2023-11-21 21:03:59,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12506 conditions, 5500 events. 3433/5500 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 37586 event pairs, 213 based on Foata normal form. 208/5531 useless extension candidates. Maximal degree in co-relation 12494. Up to 2433 conditions per place. [2023-11-21 21:03:59,398 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 59 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2023-11-21 21:03:59,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 387 flow [2023-11-21 21:03:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:03:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 21:03:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-21 21:03:59,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.728 [2023-11-21 21:03:59,403 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-21 21:03:59,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-21 21:03:59,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:59,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-21 21:03:59,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 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 21:03:59,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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 21:03:59,409 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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 21:03:59,409 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 182 transitions. [2023-11-21 21:03:59,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 387 flow [2023-11-21 21:03:59,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 21:03:59,420 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2023-11-21 21:03:59,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-11-21 21:03:59,422 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-11-21 21:03:59,422 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2023-11-21 21:03:59,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 21:03:59,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:59,423 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 21:03:59,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:03:59,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:03:59,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash -433737468, now seen corresponding path program 1 times [2023-11-21 21:03:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119112711] [2023-11-21 21:03:59,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:59,749 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 21:03:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119112711] [2023-11-21 21:03:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119112711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:59,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:03:59,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439140408] [2023-11-21 21:03:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:59,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:03:59,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:59,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:03:59,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:03:59,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-21 21:03:59,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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 21:03:59,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:59,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-21 21:03:59,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:00,625 INFO L124 PetriNetUnfolderBase]: 2355/3706 cut-off events. [2023-11-21 21:04:00,626 INFO L125 PetriNetUnfolderBase]: For 3022/3022 co-relation queries the response was YES. [2023-11-21 21:04:00,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9624 conditions, 3706 events. 2355/3706 cut-off events. For 3022/3022 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21904 event pairs, 81 based on Foata normal form. 164/3777 useless extension candidates. Maximal degree in co-relation 9610. Up to 1089 conditions per place. [2023-11-21 21:04:00,666 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 70 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2023-11-21 21:04:00,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 510 flow [2023-11-21 21:04:00,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:04:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 21:04:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-21 21:04:00,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73 [2023-11-21 21:04:00,669 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-21 21:04:00,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-21 21:04:00,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:00,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-21 21:04:00,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 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 21:04:00,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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 21:04:00,673 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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 21:04:00,673 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 219 transitions. [2023-11-21 21:04:00,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 510 flow [2023-11-21 21:04:00,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-21 21:04:00,689 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2023-11-21 21:04:00,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-11-21 21:04:00,692 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-21 21:04:00,692 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2023-11-21 21:04:00,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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 21:04:00,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:00,693 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] [2023-11-21 21:04:00,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:04:00,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:00,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -302287191, now seen corresponding path program 1 times [2023-11-21 21:04:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:00,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697561126] [2023-11-21 21:04:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:01,016 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 21:04:01,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:01,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697561126] [2023-11-21 21:04:01,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697561126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:01,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:01,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:04:01,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133412855] [2023-11-21 21:04:01,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:01,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:04:01,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:01,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:04:01,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:04:01,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-21 21:04:01,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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 21:04:01,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:01,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-21 21:04:01,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:01,628 INFO L124 PetriNetUnfolderBase]: 1527/2282 cut-off events. [2023-11-21 21:04:01,629 INFO L125 PetriNetUnfolderBase]: For 3368/3368 co-relation queries the response was YES. [2023-11-21 21:04:01,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 2282 events. 1527/2282 cut-off events. For 3368/3368 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11344 event pairs, 47 based on Foata normal form. 80/2333 useless extension candidates. Maximal degree in co-relation 6754. Up to 768 conditions per place. [2023-11-21 21:04:01,655 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 63 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2023-11-21 21:04:01,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 508 flow [2023-11-21 21:04:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:04:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 21:04:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2023-11-21 21:04:01,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-11-21 21:04:01,658 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 238 transitions. [2023-11-21 21:04:01,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 238 transitions. [2023-11-21 21:04:01,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:01,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 238 transitions. [2023-11-21 21:04:01,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 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 21:04:01,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 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 21:04:01,661 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 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 21:04:01,662 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 238 transitions. [2023-11-21 21:04:01,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 508 flow [2023-11-21 21:04:01,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-21 21:04:01,688 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2023-11-21 21:04:01,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-21 21:04:01,690 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-21 21:04:01,690 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2023-11-21 21:04:01,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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 21:04:01,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:01,691 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, 1, 1, 1, 1] [2023-11-21 21:04:01,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:04:01,691 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:01,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1046366157, now seen corresponding path program 1 times [2023-11-21 21:04:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:01,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899596721] [2023-11-21 21:04:01,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:02,240 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 21:04:02,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:02,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899596721] [2023-11-21 21:04:02,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899596721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:02,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:04:02,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306601470] [2023-11-21 21:04:02,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:02,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:04:02,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:02,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:04:02,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:04:02,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2023-11-21 21:04:02,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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 21:04:02,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:02,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2023-11-21 21:04:02,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:03,579 INFO L124 PetriNetUnfolderBase]: 5331/8423 cut-off events. [2023-11-21 21:04:03,579 INFO L125 PetriNetUnfolderBase]: For 2675/2769 co-relation queries the response was YES. [2023-11-21 21:04:03,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18843 conditions, 8423 events. 5331/8423 cut-off events. For 2675/2769 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 57228 event pairs, 1832 based on Foata normal form. 16/7881 useless extension candidates. Maximal degree in co-relation 18827. Up to 4139 conditions per place. [2023-11-21 21:04:03,678 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 38 selfloop transitions, 9 changer transitions 12/86 dead transitions. [2023-11-21 21:04:03,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 86 transitions, 442 flow [2023-11-21 21:04:03,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:04:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 21:04:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2023-11-21 21:04:03,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62 [2023-11-21 21:04:03,680 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 155 transitions. [2023-11-21 21:04:03,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 155 transitions. [2023-11-21 21:04:03,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:03,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 155 transitions. [2023-11-21 21:04:03,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 21:04:03,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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 21:04:03,683 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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 21:04:03,683 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 5 states and 155 transitions. [2023-11-21 21:04:03,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 86 transitions, 442 flow [2023-11-21 21:04:03,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 336 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-21 21:04:03,761 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 226 flow [2023-11-21 21:04:03,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-11-21 21:04:03,762 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-11-21 21:04:03,762 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 226 flow [2023-11-21 21:04:03,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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 21:04:03,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:03,763 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, 1, 1, 1, 1] [2023-11-21 21:04:03,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 21:04:03,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:03,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1658898547, now seen corresponding path program 2 times [2023-11-21 21:04:03,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:03,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628943618] [2023-11-21 21:04:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:03,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:04,084 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 21:04:04,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:04,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628943618] [2023-11-21 21:04:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628943618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:04,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:04,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:04:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412417773] [2023-11-21 21:04:04,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:04,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:04:04,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:04,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:04:04,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:04:04,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-21 21:04:04,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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 21:04:04,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:04,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-21 21:04:04,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:05,553 INFO L124 PetriNetUnfolderBase]: 5834/10421 cut-off events. [2023-11-21 21:04:05,553 INFO L125 PetriNetUnfolderBase]: For 2275/2629 co-relation queries the response was YES. [2023-11-21 21:04:05,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23056 conditions, 10421 events. 5834/10421 cut-off events. For 2275/2629 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 83817 event pairs, 1633 based on Foata normal form. 98/9637 useless extension candidates. Maximal degree in co-relation 23041. Up to 3888 conditions per place. [2023-11-21 21:04:05,657 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 50 selfloop transitions, 3 changer transitions 12/101 dead transitions. [2023-11-21 21:04:05,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 466 flow [2023-11-21 21:04:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:04:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 21:04:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2023-11-21 21:04:05,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6566666666666666 [2023-11-21 21:04:05,765 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 197 transitions. [2023-11-21 21:04:05,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 197 transitions. [2023-11-21 21:04:05,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:05,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 197 transitions. [2023-11-21 21:04:05,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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 21:04:05,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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 21:04:05,768 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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 21:04:05,768 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 226 flow. Second operand 6 states and 197 transitions. [2023-11-21 21:04:05,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 466 flow [2023-11-21 21:04:05,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 434 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-21 21:04:05,780 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 233 flow [2023-11-21 21:04:05,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2023-11-21 21:04:05,781 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2023-11-21 21:04:05,782 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 233 flow [2023-11-21 21:04:05,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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 21:04:05,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:05,782 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, 1, 1, 1, 1] [2023-11-21 21:04:05,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 21:04:05,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:05,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:05,783 INFO L85 PathProgramCache]: Analyzing trace with hash -869881035, now seen corresponding path program 3 times [2023-11-21 21:04:05,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:05,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205144493] [2023-11-21 21:04:05,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:05,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:06,112 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 21:04:06,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:06,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205144493] [2023-11-21 21:04:06,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205144493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:06,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:06,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:04:06,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486961747] [2023-11-21 21:04:06,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:06,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:04:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:06,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:04:06,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:04:06,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-21 21:04:06,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 21:04:06,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:06,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-21 21:04:06,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:08,375 INFO L124 PetriNetUnfolderBase]: 9289/16177 cut-off events. [2023-11-21 21:04:08,375 INFO L125 PetriNetUnfolderBase]: For 2652/3031 co-relation queries the response was YES. [2023-11-21 21:04:08,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35028 conditions, 16177 events. 9289/16177 cut-off events. For 2652/3031 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 136055 event pairs, 3401 based on Foata normal form. 137/14861 useless extension candidates. Maximal degree in co-relation 35012. Up to 5895 conditions per place. [2023-11-21 21:04:08,516 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 31 selfloop transitions, 3 changer transitions 28/96 dead transitions. [2023-11-21 21:04:08,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 437 flow [2023-11-21 21:04:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:04:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 21:04:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2023-11-21 21:04:08,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.672 [2023-11-21 21:04:08,519 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 168 transitions. [2023-11-21 21:04:08,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 168 transitions. [2023-11-21 21:04:08,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:08,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 168 transitions. [2023-11-21 21:04:08,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.6) internal successors, (168), 5 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 21:04:08,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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 21:04:08,522 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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 21:04:08,522 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 233 flow. Second operand 5 states and 168 transitions. [2023-11-21 21:04:08,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 437 flow [2023-11-21 21:04:08,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 430 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-21 21:04:08,543 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 221 flow [2023-11-21 21:04:08,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-21 21:04:08,546 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-11-21 21:04:08,547 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 221 flow [2023-11-21 21:04:08,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 21:04:08,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:08,548 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, 1, 1, 1, 1] [2023-11-21 21:04:08,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:04:08,548 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:08,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash 796123427, now seen corresponding path program 4 times [2023-11-21 21:04:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:08,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328897493] [2023-11-21 21:04:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:08,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:04:08,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:04:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:04:08,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:04:08,744 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 21:04:08,746 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-21 21:04:08,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-21 21:04:08,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-21 21:04:08,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-21 21:04:08,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-21 21:04:08,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-21 21:04:08,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-21 21:04:08,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 21:04:08,750 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-11-21 21:04:08,757 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 21:04:08,758 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 21:04:08,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 21:04:09,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 21:04:09,003 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-21 21:04:09,010 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-21 21:04:09,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:04:09 BasicIcfg [2023-11-21 21:04:09,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 21:04:09,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 21:04:09,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 21:04:09,069 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 21:04:09,070 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:03:54" (3/4) ... [2023-11-21 21:04:09,071 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-21 21:04:09,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 21:04:09,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 21:04:09,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-21 21:04:09,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-21 21:04:09,340 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 21:04:09,344 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 21:04:09,345 INFO L158 Benchmark]: Toolchain (without parser) took 16869.13ms. Allocated memory was 167.8MB in the beginning and 964.7MB in the end (delta: 796.9MB). Free memory was 118.9MB in the beginning and 723.8MB in the end (delta: -604.9MB). Peak memory consumption was 273.0MB. Max. memory is 16.1GB. [2023-11-21 21:04:09,345 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 167.8MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 21:04:09,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.92ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 94.1MB in the end (delta: 24.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 21:04:09,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.34ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 91.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 21:04:09,346 INFO L158 Benchmark]: Boogie Preprocessor took 63.36ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 87.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 21:04:09,347 INFO L158 Benchmark]: RCFGBuilder took 1234.83ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 87.5MB in the beginning and 138.0MB in the end (delta: -50.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-21 21:04:09,347 INFO L158 Benchmark]: TraceAbstraction took 14462.88ms. Allocated memory was 201.3MB in the beginning and 964.7MB in the end (delta: 763.4MB). Free memory was 138.0MB in the beginning and 718.6MB in the end (delta: -580.6MB). Peak memory consumption was 577.0MB. Max. memory is 16.1GB. [2023-11-21 21:04:09,347 INFO L158 Benchmark]: Witness Printer took 275.04ms. Allocated memory is still 964.7MB. Free memory was 718.6MB in the beginning and 723.8MB in the end (delta: -5.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2023-11-21 21:04:09,351 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.27ms. Allocated memory is still 167.8MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.92ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 94.1MB in the end (delta: 24.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.34ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 91.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.36ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 87.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1234.83ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 87.5MB in the beginning and 138.0MB in the end (delta: -50.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14462.88ms. Allocated memory was 201.3MB in the beginning and 964.7MB in the end (delta: 763.4MB). Free memory was 138.0MB in the beginning and 718.6MB in the end (delta: -580.6MB). Peak memory consumption was 577.0MB. Max. memory is 16.1GB. * Witness Printer took 275.04ms. Allocated memory is still 964.7MB. Free memory was 718.6MB in the beginning and 723.8MB in the end (delta: -5.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t213={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t213={5:0}, t214={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 872]: 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: 868]: 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: 870]: 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, 85 locations, 7 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: 14.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 504 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 458 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 915 IncrementalHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 37 mSDtfsCounter, 915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=5, InterpolantAutomatonStates: 41, 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.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 21:04:09,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_000a186e-1ef3-4f8f-a484-ae1f02037603/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