./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:18:16,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:18:16,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 20:18:16,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:18:16,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:18:16,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:18:16,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:18:16,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:18:16,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:18:16,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:18:16,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:18:16,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:18:16,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:18:16,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:18:16,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:18:16,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:18:16,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:18:16,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:18:16,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:18:16,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:18:16,517 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:18:16,517 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:18:16,517 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:18:16,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:18:16,518 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:18:16,518 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:18:16,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:18:16,518 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:18:16,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:18:16,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:18:16,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:18:16,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:18:16,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:18:16,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:18:16,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:18:16,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:18:16,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:18:16,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:18:16,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:18:16,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:18:16,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:18:16,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:18:16,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:18:16,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:18:16,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:18:16,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:18:16,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:18:16,523 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 [2024-11-27 20:18:17,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:18:17,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:18:17,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:18:17,032 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:18:17,032 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:18:17,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2024-11-27 20:18:20,959 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data/1586eb699/ece52cd193344b9fa302510b56279417/FLAG4ba53b935 [2024-11-27 20:18:21,503 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:18:21,506 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2024-11-27 20:18:21,540 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data/1586eb699/ece52cd193344b9fa302510b56279417/FLAG4ba53b935 [2024-11-27 20:18:21,568 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data/1586eb699/ece52cd193344b9fa302510b56279417 [2024-11-27 20:18:21,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:18:21,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:18:21,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:18:21,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:18:21,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:18:21,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:18:21" (1/1) ... [2024-11-27 20:18:21,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b970d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:21, skipping insertion in model container [2024-11-27 20:18:21,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:18:21" (1/1) ... [2024-11-27 20:18:21,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:18:22,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:18:22,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:18:22,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:18:22,314 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:18:22,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22 WrapperNode [2024-11-27 20:18:22,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:18:22,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:18:22,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:18:22,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:18:22,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,386 INFO L138 Inliner]: procedures = 175, calls = 64, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2024-11-27 20:18:22,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:18:22,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:18:22,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:18:22,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:18:22,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,453 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-11-27 20:18:22,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:18:22,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:18:22,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:18:22,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:18:22,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (1/1) ... [2024-11-27 20:18:22,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:18:22,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:22,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:18:22,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:18:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 20:18:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 20:18:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 20:18:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 20:18:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 20:18:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:18:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 20:18:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 20:18:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 20:18:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 20:18:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-27 20:18:22,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-27 20:18:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:18:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:18:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 20:18:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:18:22,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:18:22,615 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:18:22,877 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:18:22,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:18:23,762 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:18:23,763 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:18:24,947 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:18:24,948 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 20:18:24,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:18:24 BoogieIcfgContainer [2024-11-27 20:18:24,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:18:24,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:18:24,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:18:24,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:18:24,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:18:21" (1/3) ... [2024-11-27 20:18:24,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4367a96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:18:24, skipping insertion in model container [2024-11-27 20:18:24,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:22" (2/3) ... [2024-11-27 20:18:24,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4367a96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:18:24, skipping insertion in model container [2024-11-27 20:18:24,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:18:24" (3/3) ... [2024-11-27 20:18:24,965 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi006_power.opt.i [2024-11-27 20:18:24,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:18:24,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi006_power.opt.i that has 4 procedures, 81 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2024-11-27 20:18:24,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:18:25,319 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:18:25,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 82 transitions, 176 flow [2024-11-27 20:18:25,508 INFO L124 PetriNetUnfolderBase]: 2/79 cut-off events. [2024-11-27 20:18:25,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:25,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 79 events. 2/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 324 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2024-11-27 20:18:25,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 82 transitions, 176 flow [2024-11-27 20:18:25,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 79 transitions, 167 flow [2024-11-27 20:18:25,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:18:25,569 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@68ae7cf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:18:25,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-11-27 20:18:25,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:18:25,585 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-27 20:18:25,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:25,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:25,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-27 20:18:25,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:25,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash 27472430, now seen corresponding path program 1 times [2024-11-27 20:18:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:25,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698659848] [2024-11-27 20:18:25,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:25,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:26,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:26,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698659848] [2024-11-27 20:18:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698659848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:26,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:26,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:18:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652191949] [2024-11-27 20:18:26,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:26,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:18:26,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:26,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:18:26,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:18:26,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:26,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-27 20:18:26,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:26,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:26,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:28,664 INFO L124 PetriNetUnfolderBase]: 3375/5456 cut-off events. [2024-11-27 20:18:28,665 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:28,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10375 conditions, 5456 events. 3375/5456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 41985 event pairs, 3375 based on Foata normal form. 224/3842 useless extension candidates. Maximal degree in co-relation 10364. Up to 4872 conditions per place. [2024-11-27 20:18:28,739 INFO L140 encePairwiseOnDemand]: 49/82 looper letters, 29 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-11-27 20:18:28,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 161 flow [2024-11-27 20:18:28,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:18:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:18:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-27 20:18:28,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.483739837398374 [2024-11-27 20:18:28,762 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 167 flow. Second operand 3 states and 119 transitions. [2024-11-27 20:18:28,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 161 flow [2024-11-27 20:18:28,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:18:28,773 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 100 flow [2024-11-27 20:18:28,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-11-27 20:18:28,786 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -32 predicate places. [2024-11-27 20:18:28,786 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 100 flow [2024-11-27 20:18:28,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-27 20:18:28,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:28,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-27 20:18:28,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:18:28,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:28,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash 27472431, now seen corresponding path program 1 times [2024-11-27 20:18:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:28,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674966885] [2024-11-27 20:18:28,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674966885] [2024-11-27 20:18:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674966885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:18:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994229434] [2024-11-27 20:18:29,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:29,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:18:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:29,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:18:29,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:18:29,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:29,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-27 20:18:29,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:29,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:29,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:30,140 INFO L124 PetriNetUnfolderBase]: 1040/1822 cut-off events. [2024-11-27 20:18:30,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:30,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3412 conditions, 1822 events. 1040/1822 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12773 event pairs, 1040 based on Foata normal form. 0/1617 useless extension candidates. Maximal degree in co-relation 3406. Up to 1560 conditions per place. [2024-11-27 20:18:30,165 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 23 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2024-11-27 20:18:30,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 136 flow [2024-11-27 20:18:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:18:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:18:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-27 20:18:30,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35365853658536583 [2024-11-27 20:18:30,169 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 100 flow. Second operand 3 states and 87 transitions. [2024-11-27 20:18:30,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 136 flow [2024-11-27 20:18:30,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:18:30,171 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 89 flow [2024-11-27 20:18:30,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-27 20:18:30,174 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -37 predicate places. [2024-11-27 20:18:30,174 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 89 flow [2024-11-27 20:18:30,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-27 20:18:30,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:30,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:30,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:18:30,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:30,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:30,176 INFO L85 PathProgramCache]: Analyzing trace with hash -534929163, now seen corresponding path program 1 times [2024-11-27 20:18:30,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:30,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766549279] [2024-11-27 20:18:30,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:30,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:30,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766549279] [2024-11-27 20:18:30,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766549279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:30,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:30,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:18:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547968591] [2024-11-27 20:18:30,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:30,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:18:30,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:30,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:18:30,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:18:30,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:30,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2024-11-27 20:18:30,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:30,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:30,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:31,303 INFO L124 PetriNetUnfolderBase]: 818/1411 cut-off events. [2024-11-27 20:18:31,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:31,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2681 conditions, 1411 events. 818/1411 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9123 event pairs, 152 based on Foata normal form. 0/1323 useless extension candidates. Maximal degree in co-relation 2674. Up to 964 conditions per place. [2024-11-27 20:18:31,315 INFO L140 encePairwiseOnDemand]: 79/82 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-27 20:18:31,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 189 flow [2024-11-27 20:18:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:18:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:18:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-27 20:18:31,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861788617886179 [2024-11-27 20:18:31,320 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 89 flow. Second operand 3 states and 95 transitions. [2024-11-27 20:18:31,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 189 flow [2024-11-27 20:18:31,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:18:31,323 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 88 flow [2024-11-27 20:18:31,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-27 20:18:31,325 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -37 predicate places. [2024-11-27 20:18:31,325 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 88 flow [2024-11-27 20:18:31,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2024-11-27 20:18:31,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:31,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:31,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:18:31,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:31,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1857027691, now seen corresponding path program 1 times [2024-11-27 20:18:31,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:31,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801553427] [2024-11-27 20:18:31,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:31,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801553427] [2024-11-27 20:18:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801553427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:31,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:18:31,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271450004] [2024-11-27 20:18:31,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:31,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:18:31,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:31,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:18:31,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:18:31,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:31,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-27 20:18:31,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:31,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:31,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:32,082 INFO L124 PetriNetUnfolderBase]: 685/1430 cut-off events. [2024-11-27 20:18:32,083 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-27 20:18:32,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1430 events. 685/1430 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10124 event pairs, 153 based on Foata normal form. 0/1352 useless extension candidates. Maximal degree in co-relation 2584. Up to 813 conditions per place. [2024-11-27 20:18:32,098 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 36 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-27 20:18:32,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 202 flow [2024-11-27 20:18:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:18:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:18:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-27 20:18:32,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-11-27 20:18:32,100 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 97 transitions. [2024-11-27 20:18:32,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 202 flow [2024-11-27 20:18:32,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:18:32,102 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-27 20:18:32,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-27 20:18:32,106 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -37 predicate places. [2024-11-27 20:18:32,107 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-27 20:18:32,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-27 20:18:32,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:32,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:32,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:18:32,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:32,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:32,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2102848324, now seen corresponding path program 1 times [2024-11-27 20:18:32,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:32,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937532320] [2024-11-27 20:18:32,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:32,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:32,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937532320] [2024-11-27 20:18:32,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937532320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:32,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:32,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:18:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133733879] [2024-11-27 20:18:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:32,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:18:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:32,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:18:32,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:18:32,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:32,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-27 20:18:32,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:32,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:32,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:32,907 INFO L124 PetriNetUnfolderBase]: 639/1292 cut-off events. [2024-11-27 20:18:32,907 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-11-27 20:18:32,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 1292 events. 639/1292 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8476 event pairs, 225 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 2524. Up to 742 conditions per place. [2024-11-27 20:18:32,919 INFO L140 encePairwiseOnDemand]: 79/82 looper letters, 35 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-11-27 20:18:32,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 200 flow [2024-11-27 20:18:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:18:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:18:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-11-27 20:18:32,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3475609756097561 [2024-11-27 20:18:32,921 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 114 transitions. [2024-11-27 20:18:32,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 200 flow [2024-11-27 20:18:32,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:18:32,924 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-27 20:18:32,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-27 20:18:32,925 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -37 predicate places. [2024-11-27 20:18:32,925 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-27 20:18:32,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-27 20:18:32,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:32,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:32,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:18:32,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:32,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:32,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2102848325, now seen corresponding path program 1 times [2024-11-27 20:18:32,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:32,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384544133] [2024-11-27 20:18:32,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:33,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384544133] [2024-11-27 20:18:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384544133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:33,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:33,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:18:33,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227468128] [2024-11-27 20:18:33,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:33,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:18:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:33,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:18:33,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:18:33,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:33,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-27 20:18:33,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:33,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:33,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:33,969 INFO L124 PetriNetUnfolderBase]: 593/1290 cut-off events. [2024-11-27 20:18:33,969 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-27 20:18:33,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1290 events. 593/1290 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9022 event pairs, 129 based on Foata normal form. 24/1308 useless extension candidates. Maximal degree in co-relation 2428. Up to 672 conditions per place. [2024-11-27 20:18:33,981 INFO L140 encePairwiseOnDemand]: 79/82 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-11-27 20:18:33,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-11-27 20:18:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:18:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:18:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-11-27 20:18:33,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3445121951219512 [2024-11-27 20:18:33,985 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 113 transitions. [2024-11-27 20:18:33,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-11-27 20:18:33,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 189 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:18:33,987 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-27 20:18:33,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-27 20:18:33,988 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -38 predicate places. [2024-11-27 20:18:33,988 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-27 20:18:33,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-27 20:18:33,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:33,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:33,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:18:33,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:33,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:33,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2124996712, now seen corresponding path program 1 times [2024-11-27 20:18:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:33,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797621949] [2024-11-27 20:18:33,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:33,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:34,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:34,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797621949] [2024-11-27 20:18:34,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797621949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:34,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:34,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:18:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431173714] [2024-11-27 20:18:34,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:34,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:18:34,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:34,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:18:34,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:18:34,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 82 [2024-11-27 20:18:34,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-27 20:18:34,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:34,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 82 [2024-11-27 20:18:34,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:34,473 INFO L124 PetriNetUnfolderBase]: 593/1087 cut-off events. [2024-11-27 20:18:34,474 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-27 20:18:34,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 1087 events. 593/1087 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6977 event pairs, 593 based on Foata normal form. 36/1107 useless extension candidates. Maximal degree in co-relation 2225. Up to 906 conditions per place. [2024-11-27 20:18:34,485 INFO L140 encePairwiseOnDemand]: 80/82 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-27 20:18:34,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 123 flow [2024-11-27 20:18:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:18:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:18:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-27 20:18:34,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3048780487804878 [2024-11-27 20:18:34,488 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 75 transitions. [2024-11-27 20:18:34,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 123 flow [2024-11-27 20:18:34,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:18:34,490 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-27 20:18:34,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-27 20:18:34,491 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -39 predicate places. [2024-11-27 20:18:34,491 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-27 20:18:34,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-27 20:18:34,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:34,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:34,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:18:34,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:34,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2124997618, now seen corresponding path program 1 times [2024-11-27 20:18:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:34,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136332977] [2024-11-27 20:18:34,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:34,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:34,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136332977] [2024-11-27 20:18:34,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136332977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:34,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:34,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:18:34,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294612694] [2024-11-27 20:18:34,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:34,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:18:34,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:34,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:18:34,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:18:34,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 82 [2024-11-27 20:18:34,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-27 20:18:34,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:34,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 82 [2024-11-27 20:18:34,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:35,708 INFO L124 PetriNetUnfolderBase]: 1347/2255 cut-off events. [2024-11-27 20:18:35,710 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:35,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 2255 events. 1347/2255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13575 event pairs, 141 based on Foata normal form. 80/2326 useless extension candidates. Maximal degree in co-relation 4639. Up to 1297 conditions per place. [2024-11-27 20:18:35,732 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-11-27 20:18:35,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 226 flow [2024-11-27 20:18:35,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:18:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:18:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-27 20:18:35,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32926829268292684 [2024-11-27 20:18:35,735 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 108 transitions. [2024-11-27 20:18:35,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 226 flow [2024-11-27 20:18:35,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:18:35,741 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-11-27 20:18:35,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-11-27 20:18:35,742 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -36 predicate places. [2024-11-27 20:18:35,742 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-11-27 20:18:35,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-27 20:18:35,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:35,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:35,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:18:35,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:35,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1426806739, now seen corresponding path program 1 times [2024-11-27 20:18:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384430721] [2024-11-27 20:18:35,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:36,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:36,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384430721] [2024-11-27 20:18:36,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384430721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:36,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:36,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:18:36,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515478076] [2024-11-27 20:18:36,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:36,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:18:36,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:36,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:18:36,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:18:36,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 82 [2024-11-27 20:18:36,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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) [2024-11-27 20:18:36,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:36,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 82 [2024-11-27 20:18:36,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:37,105 INFO L124 PetriNetUnfolderBase]: 863/1471 cut-off events. [2024-11-27 20:18:37,105 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2024-11-27 20:18:37,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 1471 events. 863/1471 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7852 event pairs, 67 based on Foata normal form. 68/1530 useless extension candidates. Maximal degree in co-relation 3527. Up to 625 conditions per place. [2024-11-27 20:18:37,118 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-27 20:18:37,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 324 flow [2024-11-27 20:18:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:18:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:18:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-27 20:18:37,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33170731707317075 [2024-11-27 20:18:37,121 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 136 transitions. [2024-11-27 20:18:37,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 324 flow [2024-11-27 20:18:37,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 314 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 20:18:37,125 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-11-27 20:18:37,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-27 20:18:37,129 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -32 predicate places. [2024-11-27 20:18:37,129 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-11-27 20:18:37,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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) [2024-11-27 20:18:37,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:37,130 INFO L206 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] [2024-11-27 20:18:37,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:18:37,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:37,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:37,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1900025346, now seen corresponding path program 1 times [2024-11-27 20:18:37,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:37,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099950367] [2024-11-27 20:18:37,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:37,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:37,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099950367] [2024-11-27 20:18:37,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099950367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:37,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:37,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:18:37,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697329922] [2024-11-27 20:18:37,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:37,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:18:37,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:37,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:18:37,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:18:37,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 82 [2024-11-27 20:18:37,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2024-11-27 20:18:37,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:37,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 82 [2024-11-27 20:18:37,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:38,399 INFO L124 PetriNetUnfolderBase]: 475/799 cut-off events. [2024-11-27 20:18:38,399 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2024-11-27 20:18:38,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 799 events. 475/799 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3493 event pairs, 53 based on Foata normal form. 36/826 useless extension candidates. Maximal degree in co-relation 2193. Up to 268 conditions per place. [2024-11-27 20:18:38,406 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-11-27 20:18:38,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 333 flow [2024-11-27 20:18:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:18:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:18:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-27 20:18:38,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3008130081300813 [2024-11-27 20:18:38,408 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 148 transitions. [2024-11-27 20:18:38,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 333 flow [2024-11-27 20:18:38,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 308 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-27 20:18:38,418 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-11-27 20:18:38,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-11-27 20:18:38,421 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -29 predicate places. [2024-11-27 20:18:38,423 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-11-27 20:18:38,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2024-11-27 20:18:38,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:38,424 INFO L206 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] [2024-11-27 20:18:38,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:18:38,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:38,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1737529137, now seen corresponding path program 1 times [2024-11-27 20:18:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778925034] [2024-11-27 20:18:38,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:38,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:18:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778925034] [2024-11-27 20:18:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778925034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:18:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948678822] [2024-11-27 20:18:39,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:39,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:18:39,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:18:39,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:18:39,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:18:39,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 82 [2024-11-27 20:18:39,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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) [2024-11-27 20:18:39,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:39,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 82 [2024-11-27 20:18:39,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:39,620 INFO L124 PetriNetUnfolderBase]: 581/1138 cut-off events. [2024-11-27 20:18:39,620 INFO L125 PetriNetUnfolderBase]: For 575/586 co-relation queries the response was YES. [2024-11-27 20:18:39,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 1138 events. 581/1138 cut-off events. For 575/586 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6477 event pairs, 298 based on Foata normal form. 8/1095 useless extension candidates. Maximal degree in co-relation 2724. Up to 518 conditions per place. [2024-11-27 20:18:39,629 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 28 selfloop transitions, 2 changer transitions 13/62 dead transitions. [2024-11-27 20:18:39,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 309 flow [2024-11-27 20:18:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:18:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:18:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-11-27 20:18:39,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3146341463414634 [2024-11-27 20:18:39,631 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 5 states and 129 transitions. [2024-11-27 20:18:39,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 309 flow [2024-11-27 20:18:39,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 245 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-27 20:18:39,644 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 123 flow [2024-11-27 20:18:39,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2024-11-27 20:18:39,645 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -30 predicate places. [2024-11-27 20:18:39,646 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 123 flow [2024-11-27 20:18:39,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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) [2024-11-27 20:18:39,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:39,647 INFO L206 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] [2024-11-27 20:18:39,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:18:39,648 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:39,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1797339493, now seen corresponding path program 2 times [2024-11-27 20:18:39,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:18:39,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508784877] [2024-11-27 20:18:39,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:18:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:18:39,847 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:18:39,848 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 20:18:39,848 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:18:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:18:40,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:18:40,110 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:18:40,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2024-11-27 20:18:40,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2024-11-27 20:18:40,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2024-11-27 20:18:40,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2024-11-27 20:18:40,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2024-11-27 20:18:40,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2024-11-27 20:18:40,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2024-11-27 20:18:40,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2024-11-27 20:18:40,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2024-11-27 20:18:40,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2024-11-27 20:18:40,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2024-11-27 20:18:40,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2024-11-27 20:18:40,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (47 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2024-11-27 20:18:40,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (36 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 77 remaining) [2024-11-27 20:18:40,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2024-11-27 20:18:40,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2024-11-27 20:18:40,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2024-11-27 20:18:40,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2024-11-27 20:18:40,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2024-11-27 20:18:40,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2024-11-27 20:18:40,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2024-11-27 20:18:40,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2024-11-27 20:18:40,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2024-11-27 20:18:40,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2024-11-27 20:18:40,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2024-11-27 20:18:40,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2024-11-27 20:18:40,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2024-11-27 20:18:40,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2024-11-27 20:18:40,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2024-11-27 20:18:40,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 77 remaining) [2024-11-27 20:18:40,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2024-11-27 20:18:40,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2024-11-27 20:18:40,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2024-11-27 20:18:40,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2024-11-27 20:18:40,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:18:40,124 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:40,325 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 20:18:40,325 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:18:40,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:18:40 BasicIcfg [2024-11-27 20:18:40,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:18:40,340 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:18:40,340 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:18:40,340 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:18:40,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:18:24" (3/4) ... [2024-11-27 20:18:40,346 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:18:40,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:18:40,349 INFO L158 Benchmark]: Toolchain (without parser) took 18774.91ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 105.9MB in the beginning and 863.7MB in the end (delta: -757.8MB). Peak memory consumption was 290.8MB. Max. memory is 16.1GB. [2024-11-27 20:18:40,350 INFO L158 Benchmark]: CDTParser took 1.71ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:18:40,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.66ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 80.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:18:40,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.22ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:18:40,352 INFO L158 Benchmark]: Boogie Preprocessor took 128.12ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 74.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:18:40,353 INFO L158 Benchmark]: RCFGBuilder took 2432.69ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 74.2MB in the beginning and 318.4MB in the end (delta: -244.2MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2024-11-27 20:18:40,353 INFO L158 Benchmark]: TraceAbstraction took 15387.42ms. Allocated memory was 377.5MB in the beginning and 1.2GB in the end (delta: 813.7MB). Free memory was 318.4MB in the beginning and 864.0MB in the end (delta: -545.5MB). Peak memory consumption was 270.7MB. Max. memory is 16.1GB. [2024-11-27 20:18:40,354 INFO L158 Benchmark]: Witness Printer took 7.63ms. Allocated memory is still 1.2GB. Free memory was 864.0MB in the beginning and 863.7MB in the end (delta: 242.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:18:40,358 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.71ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.66ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 80.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.22ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 128.12ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 74.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2432.69ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 74.2MB in the beginning and 318.4MB in the end (delta: -244.2MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15387.42ms. Allocated memory was 377.5MB in the beginning and 1.2GB in the end (delta: 813.7MB). Free memory was 318.4MB in the beginning and 864.0MB in the end (delta: -545.5MB). Peak memory consumption was 270.7MB. Max. memory is 16.1GB. * Witness Printer took 7.63ms. Allocated memory is still 1.2GB. Free memory was 864.0MB in the beginning and 863.7MB in the end (delta: 242.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1684; [L858] FCALL, FORK 0 pthread_create(&t1684, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1684=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 0 pthread_t t1685; [L860] FCALL, FORK 0 pthread_create(&t1685, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1684=-1, t1685=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t1686; [L780] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] EXPR 2 \read(x) [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] FCALL, FORK 0 pthread_create(&t1686, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1684=-1, t1685=0, t1686=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 x$w_buff1 = x$w_buff0 [L824] 3 x$w_buff0 = 1 [L825] 3 x$w_buff1_used = x$w_buff0_used [L826] 3 x$w_buff0_used = (_Bool)1 [L827] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L827] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L828] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L829] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L830] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L831] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L832] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L836] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L837] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L838] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L839] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L842] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684=-1, t1685=0, t1686=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L866] RET 0 assume_abort_if_not(main$tmp_guard0) [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 \read(x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684=-1, t1685=0, t1686=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L877] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684=-1, t1685=0, t1686=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L18] 0 __assert_fail ("0", "rfi006_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 858]: 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: 860]: 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 7 procedures, 138 locations, 77 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.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 642 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 17 mSDtfsCounter, 642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=0, InterpolantAutomatonStates: 43, 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.9s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:18:40,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:18:43,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:18:44,002 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-27 20:18:44,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:18:44,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:18:44,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:18:44,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:18:44,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:18:44,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:18:44,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:18:44,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:18:44,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:18:44,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:18:44,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:18:44,117 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:18:44,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:18:44,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:18:44,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:18:44,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:18:44,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:18:44,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:18:44,120 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:18:44,120 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:18:44,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:18:44,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:18:44,120 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:18:44,120 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:18:44,121 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:18:44,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:18:44,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:18:44,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:18:44,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:18:44,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:18:44,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:18:44,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:18:44,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:18:44,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:18:44,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:18:44,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:18:44,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:18:44,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:18:44,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:18:44,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:18:44,126 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:18:44,126 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:18:44,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:18:44,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:18:44,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:18:44,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:18:44,126 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 [2024-11-27 20:18:44,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:18:44,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:18:44,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:18:44,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:18:44,533 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:18:44,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2024-11-27 20:18:48,366 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data/f2b909a0b/08a2fd6c1fc74574976ed2ba13501c4c/FLAG5ddb634f6 [2024-11-27 20:18:48,839 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:18:48,840 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2024-11-27 20:18:48,860 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data/f2b909a0b/08a2fd6c1fc74574976ed2ba13501c4c/FLAG5ddb634f6 [2024-11-27 20:18:48,882 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/data/f2b909a0b/08a2fd6c1fc74574976ed2ba13501c4c [2024-11-27 20:18:48,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:18:48,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:18:48,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:18:48,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:18:48,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:18:48,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:18:48" (1/1) ... [2024-11-27 20:18:48,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af31e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:48, skipping insertion in model container [2024-11-27 20:18:48,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:18:48" (1/1) ... [2024-11-27 20:18:48,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:18:49,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:18:49,697 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:18:49,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:18:49,892 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:18:49,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49 WrapperNode [2024-11-27 20:18:49,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:18:49,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:18:49,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:18:49,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:18:49,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:49,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,000 INFO L138 Inliner]: procedures = 179, calls = 64, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2024-11-27 20:18:50,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:18:50,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:18:50,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:18:50,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:18:50,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,076 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-11-27 20:18:50,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:18:50,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:18:50,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:18:50,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:18:50,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (1/1) ... [2024-11-27 20:18:50,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:18:50,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:50,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:18:50,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:18:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 20:18:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 20:18:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 20:18:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:18:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 20:18:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 20:18:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:18:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:18:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-27 20:18:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-27 20:18:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 20:18:50,224 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 20:18:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 20:18:50,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 20:18:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-27 20:18:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-27 20:18:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 20:18:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:18:50,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:18:50,229 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:18:50,526 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:18:50,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:18:51,626 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:18:51,626 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:18:53,025 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:18:53,026 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 20:18:53,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:18:53 BoogieIcfgContainer [2024-11-27 20:18:53,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:18:53,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:18:53,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:18:53,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:18:53,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:18:48" (1/3) ... [2024-11-27 20:18:53,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197f2465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:18:53, skipping insertion in model container [2024-11-27 20:18:53,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:18:49" (2/3) ... [2024-11-27 20:18:53,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197f2465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:18:53, skipping insertion in model container [2024-11-27 20:18:53,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:18:53" (3/3) ... [2024-11-27 20:18:53,046 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi006_power.opt.i [2024-11-27 20:18:53,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:18:53,073 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi006_power.opt.i that has 4 procedures, 81 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2024-11-27 20:18:53,074 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:18:53,465 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:18:53,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 82 transitions, 176 flow [2024-11-27 20:18:53,634 INFO L124 PetriNetUnfolderBase]: 2/79 cut-off events. [2024-11-27 20:18:53,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:53,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 79 events. 2/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 324 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2024-11-27 20:18:53,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 82 transitions, 176 flow [2024-11-27 20:18:53,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 79 transitions, 167 flow [2024-11-27 20:18:53,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:18:53,688 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3bf56d14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:18:53,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-11-27 20:18:53,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:18:53,696 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-27 20:18:53,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:53,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:53,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-27 20:18:53,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:53,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash 27533998, now seen corresponding path program 1 times [2024-11-27 20:18:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:53,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333107944] [2024-11-27 20:18:53,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:53,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:53,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:53,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:53,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:18:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:54,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:18:54,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:54,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:54,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:54,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333107944] [2024-11-27 20:18:54,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333107944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:54,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:18:54,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655133183] [2024-11-27 20:18:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:54,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:18:54,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:54,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:18:54,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:18:54,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:54,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-27 20:18:54,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:54,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:54,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:56,808 INFO L124 PetriNetUnfolderBase]: 3375/5456 cut-off events. [2024-11-27 20:18:56,808 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:56,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10375 conditions, 5456 events. 3375/5456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 41985 event pairs, 3375 based on Foata normal form. 224/3842 useless extension candidates. Maximal degree in co-relation 10364. Up to 4872 conditions per place. [2024-11-27 20:18:56,876 INFO L140 encePairwiseOnDemand]: 49/82 looper letters, 29 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-11-27 20:18:56,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 161 flow [2024-11-27 20:18:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:18:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:18:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-27 20:18:56,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.483739837398374 [2024-11-27 20:18:56,897 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 167 flow. Second operand 3 states and 119 transitions. [2024-11-27 20:18:56,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 161 flow [2024-11-27 20:18:56,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:18:56,914 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 100 flow [2024-11-27 20:18:56,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-11-27 20:18:56,924 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -32 predicate places. [2024-11-27 20:18:56,925 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 100 flow [2024-11-27 20:18:56,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-27 20:18:56,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:56,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-27 20:18:56,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:18:57,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:57,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:57,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash 27533999, now seen corresponding path program 1 times [2024-11-27 20:18:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:57,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629669583] [2024-11-27 20:18:57,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:57,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:57,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:57,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:57,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:18:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:57,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:18:57,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:57,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:57,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629669583] [2024-11-27 20:18:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629669583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:57,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:57,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:18:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178239662] [2024-11-27 20:18:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:57,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:18:57,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:57,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:18:57,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:18:57,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:57,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-27 20:18:57,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:57,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:57,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:57,986 INFO L124 PetriNetUnfolderBase]: 1040/1822 cut-off events. [2024-11-27 20:18:57,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:57,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3412 conditions, 1822 events. 1040/1822 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12773 event pairs, 1040 based on Foata normal form. 0/1617 useless extension candidates. Maximal degree in co-relation 3406. Up to 1560 conditions per place. [2024-11-27 20:18:58,004 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 23 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2024-11-27 20:18:58,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 136 flow [2024-11-27 20:18:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:18:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:18:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-27 20:18:58,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35365853658536583 [2024-11-27 20:18:58,007 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 100 flow. Second operand 3 states and 87 transitions. [2024-11-27 20:18:58,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 136 flow [2024-11-27 20:18:58,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:18:58,009 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 89 flow [2024-11-27 20:18:58,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-27 20:18:58,010 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -37 predicate places. [2024-11-27 20:18:58,010 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 89 flow [2024-11-27 20:18:58,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-27 20:18:58,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:58,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:58,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:18:58,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:58,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:58,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash 489898485, now seen corresponding path program 1 times [2024-11-27 20:18:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771114517] [2024-11-27 20:18:58,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:58,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:58,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:58,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:58,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:18:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:58,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:18:58,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:58,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:58,422 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:58,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771114517] [2024-11-27 20:18:58,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771114517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:58,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:58,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:18:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446115218] [2024-11-27 20:18:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:58,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:18:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:58,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:18:58,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:18:58,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:58,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2024-11-27 20:18:58,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:58,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:58,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:58,936 INFO L124 PetriNetUnfolderBase]: 818/1411 cut-off events. [2024-11-27 20:18:58,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:18:58,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2681 conditions, 1411 events. 818/1411 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9123 event pairs, 152 based on Foata normal form. 0/1323 useless extension candidates. Maximal degree in co-relation 2674. Up to 964 conditions per place. [2024-11-27 20:18:58,962 INFO L140 encePairwiseOnDemand]: 79/82 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-27 20:18:58,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 189 flow [2024-11-27 20:18:58,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:18:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:18:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-27 20:18:58,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861788617886179 [2024-11-27 20:18:58,964 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 89 flow. Second operand 3 states and 95 transitions. [2024-11-27 20:18:58,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 189 flow [2024-11-27 20:18:58,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:18:58,965 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 88 flow [2024-11-27 20:18:58,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-27 20:18:58,966 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -37 predicate places. [2024-11-27 20:18:58,967 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 88 flow [2024-11-27 20:18:58,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2024-11-27 20:18:58,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:58,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:58,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:18:59,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:59,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:18:59,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash 155895895, now seen corresponding path program 1 times [2024-11-27 20:18:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:59,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075439096] [2024-11-27 20:18:59,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:59,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:59,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:59,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:59,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:18:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:59,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:18:59,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:59,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:59,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075439096] [2024-11-27 20:18:59,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075439096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:59,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:59,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:18:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146777823] [2024-11-27 20:18:59,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:59,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:18:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:59,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:18:59,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:18:59,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:18:59,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-27 20:18:59,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:18:59,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:18:59,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:18:59,797 INFO L124 PetriNetUnfolderBase]: 685/1430 cut-off events. [2024-11-27 20:18:59,797 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-27 20:18:59,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1430 events. 685/1430 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10132 event pairs, 153 based on Foata normal form. 0/1352 useless extension candidates. Maximal degree in co-relation 2584. Up to 813 conditions per place. [2024-11-27 20:18:59,808 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 36 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-27 20:18:59,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 202 flow [2024-11-27 20:18:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:18:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:18:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-27 20:18:59,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-11-27 20:18:59,810 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 97 transitions. [2024-11-27 20:18:59,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 202 flow [2024-11-27 20:18:59,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:18:59,812 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-27 20:18:59,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-27 20:18:59,813 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -37 predicate places. [2024-11-27 20:18:59,813 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-27 20:18:59,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-27 20:18:59,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:18:59,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:59,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:19:00,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:00,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:19:00,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:00,016 INFO L85 PathProgramCache]: Analyzing trace with hash -507835962, now seen corresponding path program 1 times [2024-11-27 20:19:00,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:00,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558913600] [2024-11-27 20:19:00,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:00,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:00,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:00,025 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:00,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:19:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:00,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:19:00,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:00,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:19:00,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558913600] [2024-11-27 20:19:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558913600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:00,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:19:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866595270] [2024-11-27 20:19:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:00,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:19:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:00,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:19:00,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:19:00,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:19:00,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-27 20:19:00,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:00,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:19:00,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:00,909 INFO L124 PetriNetUnfolderBase]: 639/1360 cut-off events. [2024-11-27 20:19:00,909 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-27 20:19:00,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 1360 events. 639/1360 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9585 event pairs, 141 based on Foata normal form. 0/1342 useless extension candidates. Maximal degree in co-relation 2592. Up to 742 conditions per place. [2024-11-27 20:19:00,922 INFO L140 encePairwiseOnDemand]: 79/82 looper letters, 35 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-11-27 20:19:00,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 200 flow [2024-11-27 20:19:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:19:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:19:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-11-27 20:19:00,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3475609756097561 [2024-11-27 20:19:00,929 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 114 transitions. [2024-11-27 20:19:00,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 200 flow [2024-11-27 20:19:00,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:19:00,932 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-27 20:19:00,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-27 20:19:00,934 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -37 predicate places. [2024-11-27 20:19:00,936 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-27 20:19:00,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-27 20:19:00,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:00,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:00,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:19:01,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:01,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:19:01,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash -507835961, now seen corresponding path program 1 times [2024-11-27 20:19:01,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:01,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990768996] [2024-11-27 20:19:01,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:01,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:01,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:01,144 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:01,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:19:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:01,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:19:01,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:01,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:19:01,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:01,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990768996] [2024-11-27 20:19:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990768996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:19:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862680131] [2024-11-27 20:19:01,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:01,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:19:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:01,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:19:01,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:19:01,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 82 [2024-11-27 20:19:01,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-27 20:19:01,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:01,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 82 [2024-11-27 20:19:01,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:02,163 INFO L124 PetriNetUnfolderBase]: 593/1290 cut-off events. [2024-11-27 20:19:02,163 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-27 20:19:02,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1290 events. 593/1290 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9017 event pairs, 129 based on Foata normal form. 24/1308 useless extension candidates. Maximal degree in co-relation 2428. Up to 672 conditions per place. [2024-11-27 20:19:02,176 INFO L140 encePairwiseOnDemand]: 79/82 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-11-27 20:19:02,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-11-27 20:19:02,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:19:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:19:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-11-27 20:19:02,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3445121951219512 [2024-11-27 20:19:02,180 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 113 transitions. [2024-11-27 20:19:02,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-11-27 20:19:02,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 189 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:19:02,183 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-27 20:19:02,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-27 20:19:02,185 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -38 predicate places. [2024-11-27 20:19:02,186 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-27 20:19:02,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-27 20:19:02,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:02,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:02,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:19:02,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:02,388 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:19:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1563272666, now seen corresponding path program 1 times [2024-11-27 20:19:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552094934] [2024-11-27 20:19:02,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:02,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:02,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:02,391 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:02,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:19:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:02,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:19:02,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:02,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:19:02,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552094934] [2024-11-27 20:19:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552094934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:02,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:02,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:19:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6104909] [2024-11-27 20:19:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:02,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:19:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:02,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:19:02,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:19:02,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 82 [2024-11-27 20:19:02,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-27 20:19:02,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:02,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 82 [2024-11-27 20:19:02,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:03,089 INFO L124 PetriNetUnfolderBase]: 593/1087 cut-off events. [2024-11-27 20:19:03,091 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-27 20:19:03,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 1087 events. 593/1087 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7028 event pairs, 593 based on Foata normal form. 36/1107 useless extension candidates. Maximal degree in co-relation 2225. Up to 906 conditions per place. [2024-11-27 20:19:03,103 INFO L140 encePairwiseOnDemand]: 80/82 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-27 20:19:03,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 123 flow [2024-11-27 20:19:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:19:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:19:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-27 20:19:03,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3048780487804878 [2024-11-27 20:19:03,108 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 75 transitions. [2024-11-27 20:19:03,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 123 flow [2024-11-27 20:19:03,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:19:03,109 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-27 20:19:03,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-27 20:19:03,110 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -39 predicate places. [2024-11-27 20:19:03,110 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-27 20:19:03,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-27 20:19:03,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:03,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:03,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 20:19:03,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:03,315 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:19:03,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:03,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1563271760, now seen corresponding path program 1 times [2024-11-27 20:19:03,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:03,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593308451] [2024-11-27 20:19:03,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:03,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:03,320 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:03,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:19:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:03,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:19:03,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:03,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:19:03,561 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:03,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593308451] [2024-11-27 20:19:03,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593308451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:03,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:03,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:19:03,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650027892] [2024-11-27 20:19:03,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:03,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:19:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:03,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:19:03,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:19:03,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 82 [2024-11-27 20:19:03,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-27 20:19:03,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:03,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 82 [2024-11-27 20:19:03,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:04,354 INFO L124 PetriNetUnfolderBase]: 1347/2255 cut-off events. [2024-11-27 20:19:04,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:19:04,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 2255 events. 1347/2255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13575 event pairs, 141 based on Foata normal form. 80/2326 useless extension candidates. Maximal degree in co-relation 4639. Up to 1297 conditions per place. [2024-11-27 20:19:04,373 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-11-27 20:19:04,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 226 flow [2024-11-27 20:19:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:19:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:19:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-27 20:19:04,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32926829268292684 [2024-11-27 20:19:04,375 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 108 transitions. [2024-11-27 20:19:04,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 226 flow [2024-11-27 20:19:04,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:19:04,377 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-11-27 20:19:04,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-11-27 20:19:04,378 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -36 predicate places. [2024-11-27 20:19:04,379 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-11-27 20:19:04,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-27 20:19:04,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:04,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:04,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 20:19:04,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:04,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:19:04,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash 263925231, now seen corresponding path program 1 times [2024-11-27 20:19:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:04,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [94561214] [2024-11-27 20:19:04,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:04,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:04,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:04,585 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:04,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:19:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:04,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:19:04,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:04,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:19:04,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94561214] [2024-11-27 20:19:04,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94561214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:04,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:04,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:19:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65132230] [2024-11-27 20:19:04,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:04,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:19:04,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:04,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:19:04,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:19:04,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 82 [2024-11-27 20:19:04,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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) [2024-11-27 20:19:04,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:04,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 82 [2024-11-27 20:19:04,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:05,549 INFO L124 PetriNetUnfolderBase]: 863/1471 cut-off events. [2024-11-27 20:19:05,550 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2024-11-27 20:19:05,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 1471 events. 863/1471 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7795 event pairs, 67 based on Foata normal form. 68/1530 useless extension candidates. Maximal degree in co-relation 3527. Up to 625 conditions per place. [2024-11-27 20:19:05,564 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-27 20:19:05,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 324 flow [2024-11-27 20:19:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:19:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:19:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-27 20:19:05,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33170731707317075 [2024-11-27 20:19:05,567 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 136 transitions. [2024-11-27 20:19:05,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 324 flow [2024-11-27 20:19:05,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 314 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 20:19:05,572 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-11-27 20:19:05,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-27 20:19:05,574 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -32 predicate places. [2024-11-27 20:19:05,574 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-11-27 20:19:05,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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) [2024-11-27 20:19:05,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:05,575 INFO L206 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] [2024-11-27 20:19:05,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 20:19:05,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:05,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:19:05,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1475213570, now seen corresponding path program 1 times [2024-11-27 20:19:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:05,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [391366727] [2024-11-27 20:19:05,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:05,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:05,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:05,781 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:05,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:19:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:06,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:19:06,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:06,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:19:06,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391366727] [2024-11-27 20:19:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391366727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:19:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911895151] [2024-11-27 20:19:06,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:19:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:06,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:19:06,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:19:06,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 82 [2024-11-27 20:19:06,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2024-11-27 20:19:06,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:06,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 82 [2024-11-27 20:19:06,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:06,718 INFO L124 PetriNetUnfolderBase]: 475/799 cut-off events. [2024-11-27 20:19:06,719 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2024-11-27 20:19:06,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 799 events. 475/799 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3448 event pairs, 53 based on Foata normal form. 36/826 useless extension candidates. Maximal degree in co-relation 2193. Up to 268 conditions per place. [2024-11-27 20:19:06,725 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-11-27 20:19:06,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 333 flow [2024-11-27 20:19:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:19:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:19:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-27 20:19:06,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3008130081300813 [2024-11-27 20:19:06,727 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 148 transitions. [2024-11-27 20:19:06,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 333 flow [2024-11-27 20:19:06,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 308 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-27 20:19:06,733 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-11-27 20:19:06,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-11-27 20:19:06,734 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -29 predicate places. [2024-11-27 20:19:06,735 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-11-27 20:19:06,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2024-11-27 20:19:06,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:06,735 INFO L206 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] [2024-11-27 20:19:06,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:19:06,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:06,936 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:19:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash 862837903, now seen corresponding path program 1 times [2024-11-27 20:19:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:06,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083494769] [2024-11-27 20:19:06,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:06,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:06,941 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:06,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:19:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:07,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:19:07,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:07,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:19:07,336 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083494769] [2024-11-27 20:19:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083494769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:07,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:07,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:19:07,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192643241] [2024-11-27 20:19:07,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:07,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:19:07,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:07,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:19:07,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:19:07,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 82 [2024-11-27 20:19:07,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:19:07,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:07,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 82 [2024-11-27 20:19:07,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:07,928 INFO L124 PetriNetUnfolderBase]: 605/1172 cut-off events. [2024-11-27 20:19:07,928 INFO L125 PetriNetUnfolderBase]: For 543/554 co-relation queries the response was YES. [2024-11-27 20:19:07,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 1172 events. 605/1172 cut-off events. For 543/554 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6555 event pairs, 282 based on Foata normal form. 8/1136 useless extension candidates. Maximal degree in co-relation 2814. Up to 538 conditions per place. [2024-11-27 20:19:07,936 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 29 selfloop transitions, 2 changer transitions 17/66 dead transitions. [2024-11-27 20:19:07,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 331 flow [2024-11-27 20:19:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:19:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:19:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-27 20:19:07,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29471544715447157 [2024-11-27 20:19:07,938 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 6 states and 145 transitions. [2024-11-27 20:19:07,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 331 flow [2024-11-27 20:19:07,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 264 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-27 20:19:07,950 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 125 flow [2024-11-27 20:19:07,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-11-27 20:19:07,954 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -28 predicate places. [2024-11-27 20:19:07,954 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 125 flow [2024-11-27 20:19:07,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:19:07,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:07,954 INFO L206 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] [2024-11-27 20:19:07,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-27 20:19:08,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:08,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-27 20:19:08,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash 803027547, now seen corresponding path program 2 times [2024-11-27 20:19:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:08,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426789267] [2024-11-27 20:19:08,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:19:08,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:08,158 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:08,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:19:08,446 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:19:08,446 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 20:19:08,446 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:19:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:19:08,678 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-27 20:19:08,678 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:19:08,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2024-11-27 20:19:08,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2024-11-27 20:19:08,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2024-11-27 20:19:08,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2024-11-27 20:19:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2024-11-27 20:19:08,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2024-11-27 20:19:08,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2024-11-27 20:19:08,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2024-11-27 20:19:08,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2024-11-27 20:19:08,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2024-11-27 20:19:08,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2024-11-27 20:19:08,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2024-11-27 20:19:08,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2024-11-27 20:19:08,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2024-11-27 20:19:08,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2024-11-27 20:19:08,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2024-11-27 20:19:08,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2024-11-27 20:19:08,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2024-11-27 20:19:08,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2024-11-27 20:19:08,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2024-11-27 20:19:08,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (47 of 77 remaining) [2024-11-27 20:19:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2024-11-27 20:19:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2024-11-27 20:19:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2024-11-27 20:19:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2024-11-27 20:19:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2024-11-27 20:19:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2024-11-27 20:19:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2024-11-27 20:19:08,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2024-11-27 20:19:08,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2024-11-27 20:19:08,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2024-11-27 20:19:08,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (36 of 77 remaining) [2024-11-27 20:19:08,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 77 remaining) [2024-11-27 20:19:08,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 77 remaining) [2024-11-27 20:19:08,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 77 remaining) [2024-11-27 20:19:08,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 77 remaining) [2024-11-27 20:19:08,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 77 remaining) [2024-11-27 20:19:08,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 77 remaining) [2024-11-27 20:19:08,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2024-11-27 20:19:08,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2024-11-27 20:19:08,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2024-11-27 20:19:08,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2024-11-27 20:19:08,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2024-11-27 20:19:08,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2024-11-27 20:19:08,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2024-11-27 20:19:08,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2024-11-27 20:19:08,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2024-11-27 20:19:08,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2024-11-27 20:19:08,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2024-11-27 20:19:08,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2024-11-27 20:19:08,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2024-11-27 20:19:08,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2024-11-27 20:19:08,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2024-11-27 20:19:08,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 77 remaining) [2024-11-27 20:19:08,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2024-11-27 20:19:08,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2024-11-27 20:19:08,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2024-11-27 20:19:08,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2024-11-27 20:19:08,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 20:19:08,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:08,903 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:09,120 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 20:19:09,120 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:19:09,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:19:09 BasicIcfg [2024-11-27 20:19:09,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:19:09,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:19:09,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:19:09,136 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:19:09,137 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:18:53" (3/4) ... [2024-11-27 20:19:09,140 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:19:09,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:19:09,142 INFO L158 Benchmark]: Toolchain (without parser) took 20254.93ms. Allocated memory was 117.4MB in the beginning and 486.5MB in the end (delta: 369.1MB). Free memory was 90.7MB in the beginning and 408.6MB in the end (delta: -317.9MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2024-11-27 20:19:09,143 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:19:09,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1004.42ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 65.6MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:19:09,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.54ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 63.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:19:09,145 INFO L158 Benchmark]: Boogie Preprocessor took 122.86ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 59.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:19:09,146 INFO L158 Benchmark]: RCFGBuilder took 2898.14ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 59.1MB in the beginning and 130.2MB in the end (delta: -71.1MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. [2024-11-27 20:19:09,147 INFO L158 Benchmark]: TraceAbstraction took 16100.32ms. Allocated memory was 276.8MB in the beginning and 486.5MB in the end (delta: 209.7MB). Free memory was 129.5MB in the beginning and 408.7MB in the end (delta: -279.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:19:09,148 INFO L158 Benchmark]: Witness Printer took 9.01ms. Allocated memory is still 486.5MB. Free memory was 408.7MB in the beginning and 408.6MB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:19:09,151 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.51ms. Allocated memory is still 117.4MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1004.42ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 65.6MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.54ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 63.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 122.86ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 59.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2898.14ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 59.1MB in the beginning and 130.2MB in the end (delta: -71.1MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16100.32ms. Allocated memory was 276.8MB in the beginning and 486.5MB in the end (delta: 209.7MB). Free memory was 129.5MB in the beginning and 408.7MB in the end (delta: -279.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 9.01ms. Allocated memory is still 486.5MB. Free memory was 408.7MB in the beginning and 408.6MB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1684; [L858] FCALL, FORK 0 pthread_create(&t1684, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1684=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 0 pthread_t t1685; [L860] FCALL, FORK 0 pthread_create(&t1685, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1684=-2, t1685=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t1686; [L780] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] FCALL, FORK 0 pthread_create(&t1686, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1684=-2, t1685=-1, t1686=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 x$w_buff1 = x$w_buff0 [L824] 3 x$w_buff0 = 1 [L825] 3 x$w_buff1_used = x$w_buff0_used [L826] 3 x$w_buff0_used = (_Bool)1 [L827] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L827] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L828] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L829] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L830] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L831] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L832] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L836] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L837] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L838] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L839] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L842] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684=-2, t1685=-1, t1686=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L866] RET 0 assume_abort_if_not(main$tmp_guard0) [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 \read(x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684=-2, t1685=-1, t1686=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L877] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684=-2, t1685=-1, t1686=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L18] 0 __assert_fail ("0", "rfi006_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 858]: 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: 860]: 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 7 procedures, 138 locations, 77 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: 15.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 767 IncrementalHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 5 mSDtfsCounter, 767 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=0, InterpolantAutomatonStates: 44, 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.4s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 626 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1332 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:19:09,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39779f64-1c33-4df4-9111-792d47df431d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample