./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.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_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1 --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 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:04:26,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:04:26,176 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 14:04:26,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:04:26,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:04:26,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:04:26,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:04:26,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:04:26,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:04:26,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:04:26,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:04:26,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:04:26,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:04:26,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:04:26,207 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:04:26,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:04:26,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:04:26,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:04:26,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:04:26,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:04:26,208 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 14:04:26,208 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 14:04:26,208 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 14:04:26,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:04:26,208 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 14:04:26,209 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 14:04:26,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:04:26,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:04:26,209 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:04:26,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:04:26,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:04:26,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:04:26,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:04:26,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:04:26,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:04:26,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:04:26,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:04:26,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:04:26,211 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_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1 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 -> 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f [2024-12-02 14:04:26,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:04:26,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:04:26,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:04:26,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:04:26,508 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:04:26,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2024-12-02 14:04:29,419 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data/f15da1da2/2c7a74699e9e46ba90e90dd9d8be6be1/FLAG41b729aae [2024-12-02 14:04:29,665 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:04:29,666 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2024-12-02 14:04:29,680 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data/f15da1da2/2c7a74699e9e46ba90e90dd9d8be6be1/FLAG41b729aae [2024-12-02 14:04:29,695 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data/f15da1da2/2c7a74699e9e46ba90e90dd9d8be6be1 [2024-12-02 14:04:29,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:04:29,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:04:29,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:04:29,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:04:29,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:04:29,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:04:29" (1/1) ... [2024-12-02 14:04:29,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325b7963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:29, skipping insertion in model container [2024-12-02 14:04:29,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:04:29" (1/1) ... [2024-12-02 14:04:29,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:04:30,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:04:30,098 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:04:30,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:04:30,204 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:04:30,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30 WrapperNode [2024-12-02 14:04:30,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:04:30,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:04:30,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:04:30,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:04:30,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,253 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-12-02 14:04:30,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:04:30,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:04:30,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:04:30,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:04:30,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,285 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-12-02 14:04:30,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:04:30,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:04:30,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:04:30,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:04:30,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (1/1) ... [2024-12-02 14:04:30,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:04:30,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:30,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:04:30,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:04:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 14:04:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 14:04:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 14:04:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 14:04:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 14:04:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:04:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 14:04:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 14:04:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 14:04:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 14:04:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 14:04:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 14:04:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:04:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 14:04:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 14:04:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:04:30,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:04:30,368 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 14:04:30,527 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:04:30,530 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:04:31,026 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 14:04:31,027 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:04:31,548 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:04:31,549 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 14:04:31,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:04:31 BoogieIcfgContainer [2024-12-02 14:04:31,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:04:31,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:04:31,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:04:31,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:04:31,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:04:29" (1/3) ... [2024-12-02 14:04:31,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c6e987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:04:31, skipping insertion in model container [2024-12-02 14:04:31,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:30" (2/3) ... [2024-12-02 14:04:31,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c6e987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:04:31, skipping insertion in model container [2024-12-02 14:04:31,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:04:31" (3/3) ... [2024-12-02 14:04:31,558 INFO L128 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2024-12-02 14:04:31,571 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:04:31,573 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe007_power.oepc-thin001_power.oepc.i that has 4 procedures, 70 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2024-12-02 14:04:31,573 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 14:04:31,744 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 14:04:31,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 71 transitions, 154 flow [2024-12-02 14:04:31,839 INFO L124 PetriNetUnfolderBase]: 2/68 cut-off events. [2024-12-02 14:04:31,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:31,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 2/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 224 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-12-02 14:04:31,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 71 transitions, 154 flow [2024-12-02 14:04:31,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 68 transitions, 145 flow [2024-12-02 14:04:31,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:04:31,874 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;@e37c243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:04:31,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-12-02 14:04:31,879 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 14:04:31,880 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-12-02 14:04:31,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:31,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:31,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 14:04:31,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:31,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash 22009183, now seen corresponding path program 1 times [2024-12-02 14:04:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582518835] [2024-12-02 14:04:31,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:32,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582518835] [2024-12-02 14:04:32,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582518835] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:32,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:04:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16612055] [2024-12-02 14:04:32,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:32,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:04:32,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:32,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:04:32,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:04:32,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:32,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-02 14:04:32,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:32,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:32,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:33,180 INFO L124 PetriNetUnfolderBase]: 1505/2594 cut-off events. [2024-12-02 14:04:33,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:33,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4883 conditions, 2594 events. 1505/2594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 19328 event pairs, 1505 based on Foata normal form. 112/1935 useless extension candidates. Maximal degree in co-relation 4872. Up to 2258 conditions per place. [2024-12-02 14:04:33,206 INFO L140 encePairwiseOnDemand]: 48/71 looper letters, 27 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-12-02 14:04:33,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 155 flow [2024-12-02 14:04:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:04:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:04:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-12-02 14:04:33,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164319248826291 [2024-12-02 14:04:33,223 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 145 flow. Second operand 3 states and 110 transitions. [2024-12-02 14:04:33,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 155 flow [2024-12-02 14:04:33,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:04:33,232 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2024-12-02 14:04:33,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-12-02 14:04:33,239 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -22 predicate places. [2024-12-02 14:04:33,239 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2024-12-02 14:04:33,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-02 14:04:33,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:33,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 14:04:33,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:04:33,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:33,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 22009184, now seen corresponding path program 1 times [2024-12-02 14:04:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:33,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32416010] [2024-12-02 14:04:33,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:33,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32416010] [2024-12-02 14:04:33,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32416010] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:33,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:33,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:04:33,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026830295] [2024-12-02 14:04:33,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:33,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:04:33,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:33,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:04:33,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:04:33,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:33,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-02 14:04:33,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:33,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:33,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:33,676 INFO L124 PetriNetUnfolderBase]: 501/947 cut-off events. [2024-12-02 14:04:33,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:33,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 947 events. 501/947 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6323 event pairs, 501 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1749. Up to 784 conditions per place. [2024-12-02 14:04:33,684 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 20 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-12-02 14:04:33,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 130 flow [2024-12-02 14:04:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:04:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:04:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-12-02 14:04:33,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4131455399061033 [2024-12-02 14:04:33,686 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 88 transitions. [2024-12-02 14:04:33,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 130 flow [2024-12-02 14:04:33,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 14:04:33,687 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-12-02 14:04:33,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-12-02 14:04:33,688 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-12-02 14:04:33,688 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-12-02 14:04:33,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-02 14:04:33,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:33,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:33,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:04:33,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:33,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash 960439503, now seen corresponding path program 1 times [2024-12-02 14:04:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378260722] [2024-12-02 14:04:33,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:33,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378260722] [2024-12-02 14:04:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378260722] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:04:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596314800] [2024-12-02 14:04:33,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:33,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:04:33,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:33,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:04:33,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:04:33,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:33,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-12-02 14:04:33,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:33,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:33,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:34,158 INFO L124 PetriNetUnfolderBase]: 419/926 cut-off events. [2024-12-02 14:04:34,158 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:34,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 926 events. 419/926 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6468 event pairs, 91 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1606. Up to 517 conditions per place. [2024-12-02 14:04:34,164 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 34 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-12-02 14:04:34,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 191 flow [2024-12-02 14:04:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:04:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:04:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-12-02 14:04:34,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.460093896713615 [2024-12-02 14:04:34,166 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 98 transitions. [2024-12-02 14:04:34,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 191 flow [2024-12-02 14:04:34,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 14:04:34,168 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-12-02 14:04:34,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:34,170 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-12-02 14:04:34,170 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-12-02 14:04:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-12-02 14:04:34,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:34,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:34,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:04:34,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:34,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:34,171 INFO L85 PathProgramCache]: Analyzing trace with hash -435562146, now seen corresponding path program 1 times [2024-12-02 14:04:34,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:34,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299578811] [2024-12-02 14:04:34,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299578811] [2024-12-02 14:04:34,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299578811] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:34,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:34,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:04:34,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918821992] [2024-12-02 14:04:34,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:34,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:04:34,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:34,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:04:34,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:04:34,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:34,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-12-02 14:04:34,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:34,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:34,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:34,654 INFO L124 PetriNetUnfolderBase]: 391/740 cut-off events. [2024-12-02 14:04:34,655 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-12-02 14:04:34,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 740 events. 391/740 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4342 event pairs, 209 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 1532. Up to 472 conditions per place. [2024-12-02 14:04:34,660 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 33 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-12-02 14:04:34,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-12-02 14:04:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:04:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:04:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-12-02 14:04:34,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4084507042253521 [2024-12-02 14:04:34,662 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 116 transitions. [2024-12-02 14:04:34,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-12-02 14:04:34,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 14:04:34,664 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-12-02 14:04:34,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:34,665 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-12-02 14:04:34,665 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-12-02 14:04:34,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-12-02 14:04:34,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:34,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:34,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:04:34,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:34,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -435562145, now seen corresponding path program 1 times [2024-12-02 14:04:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949868868] [2024-12-02 14:04:34,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949868868] [2024-12-02 14:04:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949868868] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:04:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012506770] [2024-12-02 14:04:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:04:35,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:35,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:04:35,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:04:35,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:35,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-12-02 14:04:35,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:35,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:35,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:35,261 INFO L124 PetriNetUnfolderBase]: 363/838 cut-off events. [2024-12-02 14:04:35,262 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-12-02 14:04:35,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 838 events. 363/838 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5714 event pairs, 75 based on Foata normal form. 16/844 useless extension candidates. Maximal degree in co-relation 1570. Up to 428 conditions per place. [2024-12-02 14:04:35,266 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 32 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-12-02 14:04:35,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 188 flow [2024-12-02 14:04:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:04:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:04:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-12-02 14:04:35,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40492957746478875 [2024-12-02 14:04:35,268 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 115 transitions. [2024-12-02 14:04:35,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 188 flow [2024-12-02 14:04:35,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 183 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:04:35,270 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-12-02 14:04:35,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:35,271 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-12-02 14:04:35,271 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-12-02 14:04:35,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-12-02 14:04:35,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:35,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:35,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:04:35,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1983183277, now seen corresponding path program 1 times [2024-12-02 14:04:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637910315] [2024-12-02 14:04:35,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:35,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:35,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637910315] [2024-12-02 14:04:35,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637910315] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:35,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:35,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:04:35,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370721393] [2024-12-02 14:04:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:35,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:04:35,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:35,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:04:35,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:04:35,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-12-02 14:04:35,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-12-02 14:04:35,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:35,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-12-02 14:04:35,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:35,530 INFO L124 PetriNetUnfolderBase]: 363/713 cut-off events. [2024-12-02 14:04:35,531 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-12-02 14:04:35,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 713 events. 363/713 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4551 event pairs, 363 based on Foata normal form. 24/713 useless extension candidates. Maximal degree in co-relation 1445. Up to 574 conditions per place. [2024-12-02 14:04:35,534 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-12-02 14:04:35,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 121 flow [2024-12-02 14:04:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:04:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:04:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-12-02 14:04:35,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3615023474178404 [2024-12-02 14:04:35,535 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 77 transitions. [2024-12-02 14:04:35,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 121 flow [2024-12-02 14:04:35,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 14:04:35,537 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-12-02 14:04:35,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:35,538 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -28 predicate places. [2024-12-02 14:04:35,538 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-12-02 14:04:35,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-12-02 14:04:35,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:35,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:35,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:04:35,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:35,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1983184246, now seen corresponding path program 1 times [2024-12-02 14:04:35,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:35,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212151761] [2024-12-02 14:04:35,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:35,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:35,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:35,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212151761] [2024-12-02 14:04:35,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212151761] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:35,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:35,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:04:35,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466783481] [2024-12-02 14:04:35,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:35,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:04:35,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:35,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:04:35,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:04:35,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-12-02 14:04:35,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12-02 14:04:35,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:35,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-12-02 14:04:35,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:36,088 INFO L124 PetriNetUnfolderBase]: 1016/1730 cut-off events. [2024-12-02 14:04:36,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:36,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 1730 events. 1016/1730 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10245 event pairs, 96 based on Foata normal form. 60/1776 useless extension candidates. Maximal degree in co-relation 3565. Up to 1015 conditions per place. [2024-12-02 14:04:36,100 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 37 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2024-12-02 14:04:36,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 216 flow [2024-12-02 14:04:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:04:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:04:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-12-02 14:04:36,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38380281690140844 [2024-12-02 14:04:36,102 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 109 transitions. [2024-12-02 14:04:36,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 216 flow [2024-12-02 14:04:36,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 14:04:36,103 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-12-02 14:04:36,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:36,104 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -25 predicate places. [2024-12-02 14:04:36,104 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-12-02 14:04:36,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12-02 14:04:36,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:36,105 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] [2024-12-02 14:04:36,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:04:36,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:36,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1962470852, now seen corresponding path program 1 times [2024-12-02 14:04:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:36,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526627107] [2024-12-02 14:04:36,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526627107] [2024-12-02 14:04:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526627107] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:36,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:36,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:04:36,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476673675] [2024-12-02 14:04:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:36,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:04:36,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:36,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:04:36,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:04:36,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-12-02 14:04:36,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-12-02 14:04:36,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:36,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-12-02 14:04:36,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:36,740 INFO L124 PetriNetUnfolderBase]: 690/1200 cut-off events. [2024-12-02 14:04:36,740 INFO L125 PetriNetUnfolderBase]: For 321/335 co-relation queries the response was YES. [2024-12-02 14:04:36,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 1200 events. 690/1200 cut-off events. For 321/335 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6221 event pairs, 36 based on Foata normal form. 56/1244 useless extension candidates. Maximal degree in co-relation 2889. Up to 553 conditions per place. [2024-12-02 14:04:36,745 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 46 selfloop transitions, 8 changer transitions 1/67 dead transitions. [2024-12-02 14:04:36,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 310 flow [2024-12-02 14:04:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:04:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 14:04:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-12-02 14:04:36,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38591549295774646 [2024-12-02 14:04:36,747 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 137 transitions. [2024-12-02 14:04:36,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 310 flow [2024-12-02 14:04:36,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 300 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 14:04:36,749 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-12-02 14:04:36,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:36,750 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -21 predicate places. [2024-12-02 14:04:36,750 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-12-02 14:04:36,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-12-02 14:04:36,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:36,751 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] [2024-12-02 14:04:36,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:04:36,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:36,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2049996894, now seen corresponding path program 1 times [2024-12-02 14:04:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:36,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281652120] [2024-12-02 14:04:36,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:36,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:36,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281652120] [2024-12-02 14:04:36,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281652120] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:36,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:36,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:04:36,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514916709] [2024-12-02 14:04:36,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:36,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:04:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:36,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:04:36,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:04:36,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-12-02 14:04:36,984 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.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-12-02 14:04:36,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:36,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-12-02 14:04:36,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:37,246 INFO L124 PetriNetUnfolderBase]: 371/643 cut-off events. [2024-12-02 14:04:37,246 INFO L125 PetriNetUnfolderBase]: For 586/614 co-relation queries the response was YES. [2024-12-02 14:04:37,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 643 events. 371/643 cut-off events. For 586/614 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2668 event pairs, 25 based on Foata normal form. 36/667 useless extension candidates. Maximal degree in co-relation 1781. Up to 228 conditions per place. [2024-12-02 14:04:37,249 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 41 selfloop transitions, 11 changer transitions 1/65 dead transitions. [2024-12-02 14:04:37,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 323 flow [2024-12-02 14:04:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:04:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:04:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-12-02 14:04:37,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3544600938967136 [2024-12-02 14:04:37,251 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 151 transitions. [2024-12-02 14:04:37,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 323 flow [2024-12-02 14:04:37,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 298 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-12-02 14:04:37,255 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-12-02 14:04:37,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:37,256 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-12-02 14:04:37,256 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-12-02 14:04:37,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-12-02 14:04:37,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:37,257 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-12-02 14:04:37,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 14:04:37,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:37,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1692821580, now seen corresponding path program 1 times [2024-12-02 14:04:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:37,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547420857] [2024-12-02 14:04:37,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:37,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-12-02 14:04:37,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:37,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547420857] [2024-12-02 14:04:37,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547420857] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:37,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:37,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:04:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170110576] [2024-12-02 14:04:37,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:37,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:04:37,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:37,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:04:37,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:04:37,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 71 [2024-12-02 14:04:37,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-12-02 14:04:37,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:37,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 71 [2024-12-02 14:04:37,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:37,839 INFO L124 PetriNetUnfolderBase]: 442/888 cut-off events. [2024-12-02 14:04:37,839 INFO L125 PetriNetUnfolderBase]: For 493/507 co-relation queries the response was YES. [2024-12-02 14:04:37,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 888 events. 442/888 cut-off events. For 493/507 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4633 event pairs, 83 based on Foata normal form. 8/863 useless extension candidates. Maximal degree in co-relation 2186. Up to 284 conditions per place. [2024-12-02 14:04:37,843 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 26 selfloop transitions, 3 changer transitions 17/66 dead transitions. [2024-12-02 14:04:37,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 325 flow [2024-12-02 14:04:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:04:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:04:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-12-02 14:04:37,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36384976525821594 [2024-12-02 14:04:37,845 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 6 states and 155 transitions. [2024-12-02 14:04:37,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 325 flow [2024-12-02 14:04:37,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 261 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-12-02 14:04:37,850 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 125 flow [2024-12-02 14:04:37,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-12-02 14:04:37,850 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-12-02 14:04:37,851 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 125 flow [2024-12-02 14:04:37,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-12-02 14:04:37,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:37,851 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-12-02 14:04:37,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:04:37,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:37,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash -98366910, now seen corresponding path program 2 times [2024-12-02 14:04:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:37,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635513365] [2024-12-02 14:04:37,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:04:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:37,928 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 14:04:37,928 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:04:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635513365] [2024-12-02 14:04:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635513365] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:38,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:38,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:04:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160066763] [2024-12-02 14:04:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:38,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:04:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:38,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:04:38,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:04:38,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 71 [2024-12-02 14:04:38,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-12-02 14:04:38,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:38,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 71 [2024-12-02 14:04:38,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:38,416 INFO L124 PetriNetUnfolderBase]: 398/832 cut-off events. [2024-12-02 14:04:38,416 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-12-02 14:04:38,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 832 events. 398/832 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4348 event pairs, 165 based on Foata normal form. 8/794 useless extension candidates. Maximal degree in co-relation 1727. Up to 233 conditions per place. [2024-12-02 14:04:38,420 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 26 selfloop transitions, 3 changer transitions 19/68 dead transitions. [2024-12-02 14:04:38,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 287 flow [2024-12-02 14:04:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:04:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:04:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-12-02 14:04:38,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3685446009389671 [2024-12-02 14:04:38,422 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 125 flow. Second operand 6 states and 157 transitions. [2024-12-02 14:04:38,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 287 flow [2024-12-02 14:04:38,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 271 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-12-02 14:04:38,424 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 127 flow [2024-12-02 14:04:38,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-12-02 14:04:38,425 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -17 predicate places. [2024-12-02 14:04:38,425 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 127 flow [2024-12-02 14:04:38,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-12-02 14:04:38,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:38,425 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-12-02 14:04:38,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:04:38,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:38,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash 320845368, now seen corresponding path program 3 times [2024-12-02 14:04:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057801139] [2024-12-02 14:04:38,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 14:04:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:38,509 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 14:04:38,509 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 14:04:38,509 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:04:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:04:38,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:04:38,621 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:04:38,622 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-12-02 14:04:38,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-12-02 14:04:38,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-12-02 14:04:38,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2024-12-02 14:04:38,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-12-02 14:04:38,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-12-02 14:04:38,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-12-02 14:04:38,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-12-02 14:04:38,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-12-02 14:04:38,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-12-02 14:04:38,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-12-02 14:04:38,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-12-02 14:04:38,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-12-02 14:04:38,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-12-02 14:04:38,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-12-02 14:04:38,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-12-02 14:04:38,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (25 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-12-02 14:04:38,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-12-02 14:04:38,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-12-02 14:04:38,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 14:04:38,629 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:38,720 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 14:04:38,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:04:38,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:04:38 BasicIcfg [2024-12-02 14:04:38,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:04:38,727 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:04:38,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:04:38,727 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:04:38,728 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:04:31" (3/4) ... [2024-12-02 14:04:38,730 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 14:04:38,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:04:38,732 INFO L158 Benchmark]: Toolchain (without parser) took 9033.58ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 114.2MB in the beginning and 141.6MB in the end (delta: -27.4MB). Peak memory consumption was 225.5MB. Max. memory is 16.1GB. [2024-12-02 14:04:38,732 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:04:38,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.54ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 90.7MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 14:04:38,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.44ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:04:38,733 INFO L158 Benchmark]: Boogie Preprocessor took 52.95ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 84.9MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 14:04:38,733 INFO L158 Benchmark]: RCFGBuilder took 1241.46ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 66.4MB in the end (delta: 18.5MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-12-02 14:04:38,734 INFO L158 Benchmark]: TraceAbstraction took 7175.13ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 65.7MB in the beginning and 141.6MB in the end (delta: -75.9MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. [2024-12-02 14:04:38,734 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 394.3MB. Free memory was 141.6MB in the beginning and 141.6MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:04:38,736 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.34ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.54ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 90.7MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.44ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.95ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 84.9MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1241.46ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 66.4MB in the end (delta: 18.5MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7175.13ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 65.7MB in the beginning and 141.6MB in the end (delta: -75.9MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 394.3MB. Free memory was 141.6MB in the beginning and 141.6MB in the end (delta: 22.5kB). 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_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((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_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1937=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t1938; [L840] FCALL, FORK 0 pthread_create(&t1938, ((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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937=-2, t1938=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t1939; [L842] FCALL, FORK 0 pthread_create(&t1939, ((void *)0), P2, ((void *)0)) 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=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937=-2, t1938=-1, t1939=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 x = 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=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L794] 2 __unbuffered_p1_EAX = x 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=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 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=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L809] 3 __unbuffered_p2_EAX = y 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=1, __unbuffered_p2_EAX=1, 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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 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=1, __unbuffered_p2_EAX=1, 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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$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=1, __unbuffered_p2_EAX=1, 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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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=1, __unbuffered_p2_EAX=1, 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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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=1, __unbuffered_p2_EAX=1, 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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L822] 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=1, __unbuffered_p2_EAX=1, 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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 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=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1937=-2, t1938=-1, t1939=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\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=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1937=-2, t1938=-1, t1939=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1937=-2, t1938=-1, t1939=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L859] 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}, \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=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L18] 0 __assert_fail ("0", "safe007_power.oepc-thin001_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 842]: 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: 840]: 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, 116 locations, 55 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: 6.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672 IncrementalHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 5 mSDtfsCounter, 672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=9, InterpolantAutomatonStates: 47, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 636 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-12-02 14:04:38,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/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_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1 --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 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:04:40,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:04:41,064 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-12-02 14:04:41,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:04:41,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:04:41,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:04:41,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:04:41,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:04:41,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:04:41,097 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:04:41,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:04:41,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:04:41,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:04:41,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:04:41,098 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:04:41,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:04:41,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:04:41,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:04:41,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:04:41,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:04:41,098 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 14:04:41,098 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 14:04:41,098 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 14:04:41,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:04:41,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 14:04:41,099 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 14:04:41,099 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 14:04:41,099 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 14:04:41,099 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:04:41,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:04:41,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:04:41,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:04:41,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:04:41,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:04:41,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:04:41,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:04:41,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:04:41,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:04:41,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:04:41,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:04:41,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:04:41,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:04:41,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:04:41,101 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 14:04:41,101 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 14:04:41,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:04:41,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:04:41,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:04:41,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:04:41,101 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_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1 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 -> 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f [2024-12-02 14:04:41,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:04:41,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:04:41,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:04:41,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:04:41,368 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:04:41,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2024-12-02 14:04:44,358 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data/fbc64970e/e8e1146b87b04fe2b315c477a452417e/FLAG62b5d6c02 [2024-12-02 14:04:44,587 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:04:44,588 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2024-12-02 14:04:44,601 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data/fbc64970e/e8e1146b87b04fe2b315c477a452417e/FLAG62b5d6c02 [2024-12-02 14:04:44,909 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/data/fbc64970e/e8e1146b87b04fe2b315c477a452417e [2024-12-02 14:04:44,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:04:44,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:04:44,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:04:44,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:04:44,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:04:44,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:04:44" (1/1) ... [2024-12-02 14:04:44,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1329e168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:44, skipping insertion in model container [2024-12-02 14:04:44,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:04:44" (1/1) ... [2024-12-02 14:04:44,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:04:45,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:04:45,278 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:04:45,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:04:45,388 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:04:45,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45 WrapperNode [2024-12-02 14:04:45,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:04:45,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:04:45,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:04:45,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:04:45,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,437 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-12-02 14:04:45,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:04:45,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:04:45,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:04:45,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:04:45,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,472 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-12-02 14:04:45,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:04:45,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:04:45,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:04:45,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:04:45,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (1/1) ... [2024-12-02 14:04:45,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:04:45,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:45,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:04:45,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-12-02 14:04:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-12-02 14:04:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 14:04:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 14:04:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 14:04:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 14:04:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 14:04:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 14:04:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 14:04:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:04:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:04:45,576 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 14:04:45,728 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:04:45,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:04:46,271 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 14:04:46,271 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:04:46,970 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:04:46,970 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 14:04:46,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:04:46 BoogieIcfgContainer [2024-12-02 14:04:46,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:04:46,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:04:46,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:04:46,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:04:46,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:04:44" (1/3) ... [2024-12-02 14:04:46,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727a810d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:04:46, skipping insertion in model container [2024-12-02 14:04:46,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:04:45" (2/3) ... [2024-12-02 14:04:46,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727a810d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:04:46, skipping insertion in model container [2024-12-02 14:04:46,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:04:46" (3/3) ... [2024-12-02 14:04:46,979 INFO L128 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2024-12-02 14:04:46,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:04:46,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe007_power.oepc-thin001_power.oepc.i that has 4 procedures, 70 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2024-12-02 14:04:46,994 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 14:04:47,152 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 14:04:47,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 71 transitions, 154 flow [2024-12-02 14:04:47,236 INFO L124 PetriNetUnfolderBase]: 2/68 cut-off events. [2024-12-02 14:04:47,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:47,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 2/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 224 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-12-02 14:04:47,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 71 transitions, 154 flow [2024-12-02 14:04:47,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 68 transitions, 145 flow [2024-12-02 14:04:47,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:04:47,262 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;@3df9c8f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:04:47,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-12-02 14:04:47,267 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 14:04:47,267 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-12-02 14:04:47,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:47,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:47,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 14:04:47,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:47,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash 22070751, now seen corresponding path program 1 times [2024-12-02 14:04:47,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:47,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1602708709] [2024-12-02 14:04:47,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:47,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:47,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:47,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:47,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:04:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:47,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 14:04:47,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:47,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:47,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:47,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602708709] [2024-12-02 14:04:47,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602708709] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:47,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:47,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:04:47,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573976328] [2024-12-02 14:04:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:47,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:04:47,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:47,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:04:47,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:04:47,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:47,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-02 14:04:47,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:47,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:47,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:48,323 INFO L124 PetriNetUnfolderBase]: 1505/2594 cut-off events. [2024-12-02 14:04:48,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:48,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4883 conditions, 2594 events. 1505/2594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 19328 event pairs, 1505 based on Foata normal form. 112/1935 useless extension candidates. Maximal degree in co-relation 4872. Up to 2258 conditions per place. [2024-12-02 14:04:48,345 INFO L140 encePairwiseOnDemand]: 48/71 looper letters, 27 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-12-02 14:04:48,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 155 flow [2024-12-02 14:04:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:04:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:04:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-12-02 14:04:48,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164319248826291 [2024-12-02 14:04:48,358 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 145 flow. Second operand 3 states and 110 transitions. [2024-12-02 14:04:48,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 155 flow [2024-12-02 14:04:48,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:04:48,365 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2024-12-02 14:04:48,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-12-02 14:04:48,370 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -22 predicate places. [2024-12-02 14:04:48,371 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2024-12-02 14:04:48,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-02 14:04:48,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:48,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 14:04:48,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:04:48,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:48,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:48,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:48,573 INFO L85 PathProgramCache]: Analyzing trace with hash 22070752, now seen corresponding path program 1 times [2024-12-02 14:04:48,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:48,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015954706] [2024-12-02 14:04:48,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:48,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:48,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:48,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:48,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:04:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:48,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 14:04:48,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:48,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:48,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015954706] [2024-12-02 14:04:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015954706] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:48,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:48,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:04:48,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962219589] [2024-12-02 14:04:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:48,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:04:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:48,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:04:48,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:04:48,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:48,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-02 14:04:48,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:48,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:48,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:49,020 INFO L124 PetriNetUnfolderBase]: 501/947 cut-off events. [2024-12-02 14:04:49,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:49,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 947 events. 501/947 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6323 event pairs, 501 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1749. Up to 784 conditions per place. [2024-12-02 14:04:49,025 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 20 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-12-02 14:04:49,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 130 flow [2024-12-02 14:04:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:04:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:04:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-12-02 14:04:49,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4131455399061033 [2024-12-02 14:04:49,028 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 88 transitions. [2024-12-02 14:04:49,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 130 flow [2024-12-02 14:04:49,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 14:04:49,029 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-12-02 14:04:49,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-12-02 14:04:49,030 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-12-02 14:04:49,031 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-12-02 14:04:49,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-02 14:04:49,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:49,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:49,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 14:04:49,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:49,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:49,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1321604207, now seen corresponding path program 1 times [2024-12-02 14:04:49,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:49,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753833513] [2024-12-02 14:04:49,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:49,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:49,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:49,235 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:49,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:04:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:49,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 14:04:49,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:49,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:49,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:49,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753833513] [2024-12-02 14:04:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753833513] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:49,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:49,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:04:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757213624] [2024-12-02 14:04:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:49,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:04:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:49,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:04:49,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:04:49,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:49,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-12-02 14:04:49,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:49,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:49,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:49,683 INFO L124 PetriNetUnfolderBase]: 419/926 cut-off events. [2024-12-02 14:04:49,684 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:49,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 926 events. 419/926 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6468 event pairs, 91 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1606. Up to 517 conditions per place. [2024-12-02 14:04:49,688 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 34 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-12-02 14:04:49,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 191 flow [2024-12-02 14:04:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:04:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:04:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-12-02 14:04:49,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.460093896713615 [2024-12-02 14:04:49,690 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 98 transitions. [2024-12-02 14:04:49,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 191 flow [2024-12-02 14:04:49,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 14:04:49,692 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-12-02 14:04:49,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:49,693 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-12-02 14:04:49,693 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-12-02 14:04:49,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-12-02 14:04:49,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:49,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:49,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 14:04:49,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:49,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1248720864, now seen corresponding path program 1 times [2024-12-02 14:04:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:49,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698262095] [2024-12-02 14:04:49,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:49,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:49,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:49,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:49,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:04:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:50,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 14:04:50,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:50,166 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:50,166 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:50,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698262095] [2024-12-02 14:04:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698262095] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:50,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:50,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:04:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976906685] [2024-12-02 14:04:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:50,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:04:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:50,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:04:50,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:04:50,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:50,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-12-02 14:04:50,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:50,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:50,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:50,425 INFO L124 PetriNetUnfolderBase]: 391/740 cut-off events. [2024-12-02 14:04:50,425 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-12-02 14:04:50,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 740 events. 391/740 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4370 event pairs, 209 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 1532. Up to 472 conditions per place. [2024-12-02 14:04:50,430 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 33 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-12-02 14:04:50,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-12-02 14:04:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:04:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:04:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-12-02 14:04:50,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4084507042253521 [2024-12-02 14:04:50,432 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 116 transitions. [2024-12-02 14:04:50,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-12-02 14:04:50,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 14:04:50,434 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-12-02 14:04:50,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:50,435 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-12-02 14:04:50,435 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-12-02 14:04:50,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-12-02 14:04:50,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:50,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:50,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:04:50,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:50,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:50,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1248720865, now seen corresponding path program 1 times [2024-12-02 14:04:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [98362800] [2024-12-02 14:04:50,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:50,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:50,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:50,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:50,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:04:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:50,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:04:50,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:50,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:50,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98362800] [2024-12-02 14:04:50,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98362800] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:50,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:04:50,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297960417] [2024-12-02 14:04:50,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:50,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:04:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:50,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:04:50,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:04:50,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-12-02 14:04:50,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-12-02 14:04:50,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:50,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-12-02 14:04:50,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:51,175 INFO L124 PetriNetUnfolderBase]: 363/838 cut-off events. [2024-12-02 14:04:51,176 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-12-02 14:04:51,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 838 events. 363/838 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5668 event pairs, 75 based on Foata normal form. 16/844 useless extension candidates. Maximal degree in co-relation 1570. Up to 428 conditions per place. [2024-12-02 14:04:51,181 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 32 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-12-02 14:04:51,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 188 flow [2024-12-02 14:04:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:04:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:04:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-12-02 14:04:51,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40492957746478875 [2024-12-02 14:04:51,183 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 115 transitions. [2024-12-02 14:04:51,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 188 flow [2024-12-02 14:04:51,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 183 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:04:51,185 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-12-02 14:04:51,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:51,186 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-12-02 14:04:51,186 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-12-02 14:04:51,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-12-02 14:04:51,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:51,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:51,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:04:51,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:51,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:51,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1705086101, now seen corresponding path program 1 times [2024-12-02 14:04:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:51,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579909522] [2024-12-02 14:04:51,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:51,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:51,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:51,390 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:51,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:04:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:51,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 14:04:51,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:51,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:51,542 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579909522] [2024-12-02 14:04:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579909522] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:04:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464944677] [2024-12-02 14:04:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:51,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:04:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:51,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:04:51,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:04:51,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-12-02 14:04:51,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-12-02 14:04:51,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:51,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-12-02 14:04:51,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:51,758 INFO L124 PetriNetUnfolderBase]: 363/713 cut-off events. [2024-12-02 14:04:51,759 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-12-02 14:04:51,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 713 events. 363/713 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4525 event pairs, 363 based on Foata normal form. 24/713 useless extension candidates. Maximal degree in co-relation 1445. Up to 574 conditions per place. [2024-12-02 14:04:51,764 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-12-02 14:04:51,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 121 flow [2024-12-02 14:04:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:04:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:04:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-12-02 14:04:51,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3615023474178404 [2024-12-02 14:04:51,766 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 77 transitions. [2024-12-02 14:04:51,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 121 flow [2024-12-02 14:04:51,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 14:04:51,767 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-12-02 14:04:51,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:51,768 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -28 predicate places. [2024-12-02 14:04:51,768 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-12-02 14:04:51,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-12-02 14:04:51,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:51,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:51,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-12-02 14:04:51,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:51,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1705085132, now seen corresponding path program 1 times [2024-12-02 14:04:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384711333] [2024-12-02 14:04:51,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:51,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:51,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:51,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:51,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:04:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:52,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 14:04:52,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:52,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:52,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384711333] [2024-12-02 14:04:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384711333] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:04:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156653191] [2024-12-02 14:04:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:52,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:04:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:52,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:04:52,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:04:52,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-12-02 14:04:52,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12-02 14:04:52,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:52,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-12-02 14:04:52,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:52,437 INFO L124 PetriNetUnfolderBase]: 1016/1730 cut-off events. [2024-12-02 14:04:52,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:04:52,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 1730 events. 1016/1730 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10225 event pairs, 96 based on Foata normal form. 60/1776 useless extension candidates. Maximal degree in co-relation 3565. Up to 1015 conditions per place. [2024-12-02 14:04:52,445 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 37 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2024-12-02 14:04:52,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 216 flow [2024-12-02 14:04:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:04:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:04:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-12-02 14:04:52,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38380281690140844 [2024-12-02 14:04:52,446 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 109 transitions. [2024-12-02 14:04:52,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 216 flow [2024-12-02 14:04:52,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 14:04:52,448 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-12-02 14:04:52,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:52,449 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -25 predicate places. [2024-12-02 14:04:52,449 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-12-02 14:04:52,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12-02 14:04:52,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:52,449 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] [2024-12-02 14:04:52,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 14:04:52,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:52,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:52,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1459412924, now seen corresponding path program 1 times [2024-12-02 14:04:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129544152] [2024-12-02 14:04:52,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:52,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:52,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:52,653 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:52,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:04:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:52,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 14:04:52,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:52,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:52,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:52,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129544152] [2024-12-02 14:04:52,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129544152] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:52,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:52,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:04:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684157902] [2024-12-02 14:04:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:52,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:04:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:52,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:04:52,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:04:52,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-12-02 14:04:52,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-12-02 14:04:52,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:52,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-12-02 14:04:52,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:53,181 INFO L124 PetriNetUnfolderBase]: 690/1200 cut-off events. [2024-12-02 14:04:53,181 INFO L125 PetriNetUnfolderBase]: For 321/335 co-relation queries the response was YES. [2024-12-02 14:04:53,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 1200 events. 690/1200 cut-off events. For 321/335 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6250 event pairs, 36 based on Foata normal form. 56/1244 useless extension candidates. Maximal degree in co-relation 2889. Up to 553 conditions per place. [2024-12-02 14:04:53,187 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 46 selfloop transitions, 8 changer transitions 1/67 dead transitions. [2024-12-02 14:04:53,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 310 flow [2024-12-02 14:04:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:04:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 14:04:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-12-02 14:04:53,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38591549295774646 [2024-12-02 14:04:53,189 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 137 transitions. [2024-12-02 14:04:53,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 310 flow [2024-12-02 14:04:53,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 300 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 14:04:53,192 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-12-02 14:04:53,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:53,192 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -21 predicate places. [2024-12-02 14:04:53,192 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-12-02 14:04:53,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-12-02 14:04:53,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:53,193 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] [2024-12-02 14:04:53,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:04:53,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:53,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:53,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1765733728, now seen corresponding path program 1 times [2024-12-02 14:04:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693818589] [2024-12-02 14:04:53,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:53,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:53,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:53,396 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:53,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 14:04:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:53,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 14:04:53,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:53,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:53,600 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:53,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693818589] [2024-12-02 14:04:53,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693818589] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:53,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:53,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:04:53,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564844252] [2024-12-02 14:04:53,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:53,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:04:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:53,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:04:53,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:04:53,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-12-02 14:04:53,608 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.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-12-02 14:04:53,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:53,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-12-02 14:04:53,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:53,927 INFO L124 PetriNetUnfolderBase]: 371/643 cut-off events. [2024-12-02 14:04:53,927 INFO L125 PetriNetUnfolderBase]: For 581/612 co-relation queries the response was YES. [2024-12-02 14:04:53,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 643 events. 371/643 cut-off events. For 581/612 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2645 event pairs, 25 based on Foata normal form. 36/667 useless extension candidates. Maximal degree in co-relation 1781. Up to 228 conditions per place. [2024-12-02 14:04:53,930 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 41 selfloop transitions, 11 changer transitions 1/65 dead transitions. [2024-12-02 14:04:53,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 323 flow [2024-12-02 14:04:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:04:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:04:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-12-02 14:04:53,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3544600938967136 [2024-12-02 14:04:53,932 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 151 transitions. [2024-12-02 14:04:53,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 323 flow [2024-12-02 14:04:53,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 298 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-12-02 14:04:53,936 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-12-02 14:04:53,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, 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-12-02 14:04:53,937 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-12-02 14:04:53,937 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-12-02 14:04:53,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-12-02 14:04:53,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:53,937 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-12-02 14:04:53,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 14:04:54,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:54,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:54,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1763834922, now seen corresponding path program 1 times [2024-12-02 14:04:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410554722] [2024-12-02 14:04:54,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:54,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:54,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:54,141 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:54,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 14:04:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:54,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-12-02 14:04:54,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:54,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:54,498 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410554722] [2024-12-02 14:04:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410554722] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:54,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:54,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 14:04:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074967566] [2024-12-02 14:04:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:54,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 14:04:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 14:04:54,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:04:54,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 71 [2024-12-02 14:04:54,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-12-02 14:04:54,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:54,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 71 [2024-12-02 14:04:54,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:54,984 INFO L124 PetriNetUnfolderBase]: 784/1400 cut-off events. [2024-12-02 14:04:54,984 INFO L125 PetriNetUnfolderBase]: For 1352/1356 co-relation queries the response was YES. [2024-12-02 14:04:54,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3749 conditions, 1400 events. 784/1400 cut-off events. For 1352/1356 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7196 event pairs, 159 based on Foata normal form. 8/1397 useless extension candidates. Maximal degree in co-relation 3735. Up to 594 conditions per place. [2024-12-02 14:04:54,994 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 54 selfloop transitions, 7 changer transitions 19/90 dead transitions. [2024-12-02 14:04:54,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 525 flow [2024-12-02 14:04:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:04:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 14:04:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-12-02 14:04:54,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3420523138832998 [2024-12-02 14:04:54,995 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 7 states and 170 transitions. [2024-12-02 14:04:54,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 525 flow [2024-12-02 14:04:55,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 408 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-12-02 14:04:55,009 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 168 flow [2024-12-02 14:04:55,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2024-12-02 14:04:55,010 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -15 predicate places. [2024-12-02 14:04:55,010 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 168 flow [2024-12-02 14:04:55,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-12-02 14:04:55,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:55,010 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-12-02 14:04:55,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 14:04:55,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:55,211 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:55,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -30164626, now seen corresponding path program 2 times [2024-12-02 14:04:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:55,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957054825] [2024-12-02 14:04:55,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:04:55,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:55,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:55,214 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:55,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 14:04:55,356 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 14:04:55,356 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:04:55,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-12-02 14:04:55,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:55,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:04:55,509 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:04:55,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957054825] [2024-12-02 14:04:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957054825] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:04:55,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:04:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 14:04:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543487360] [2024-12-02 14:04:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:04:55,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 14:04:55,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:04:55,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 14:04:55,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:04:55,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 71 [2024-12-02 14:04:55,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 168 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-12-02 14:04:55,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:04:55,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 71 [2024-12-02 14:04:55,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:04:55,909 INFO L124 PetriNetUnfolderBase]: 696/1203 cut-off events. [2024-12-02 14:04:55,909 INFO L125 PetriNetUnfolderBase]: For 405/414 co-relation queries the response was YES. [2024-12-02 14:04:55,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 1203 events. 696/1203 cut-off events. For 405/414 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5776 event pairs, 159 based on Foata normal form. 10/1179 useless extension candidates. Maximal degree in co-relation 2826. Up to 584 conditions per place. [2024-12-02 14:04:55,914 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 42 selfloop transitions, 8 changer transitions 29/90 dead transitions. [2024-12-02 14:04:55,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 461 flow [2024-12-02 14:04:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:04:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 14:04:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-12-02 14:04:55,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3319919517102616 [2024-12-02 14:04:55,915 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 168 flow. Second operand 7 states and 165 transitions. [2024-12-02 14:04:55,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 461 flow [2024-12-02 14:04:55,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 447 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-12-02 14:04:55,918 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 209 flow [2024-12-02 14:04:55,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2024-12-02 14:04:55,919 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -9 predicate places. [2024-12-02 14:04:55,919 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 209 flow [2024-12-02 14:04:55,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-12-02 14:04:55,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:04:55,919 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-12-02 14:04:55,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 14:04:56,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:56,120 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-12-02 14:04:56,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash 977450904, now seen corresponding path program 3 times [2024-12-02 14:04:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:04:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123428050] [2024-12-02 14:04:56,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 14:04:56,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:56,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:56,123 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:56,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 14:04:56,270 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 14:04:56,270 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 14:04:56,270 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:04:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:04:56,378 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-12-02 14:04:56,378 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:04:56,379 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-12-02 14:04:56,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-12-02 14:04:56,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-12-02 14:04:56,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2024-12-02 14:04:56,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (25 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-12-02 14:04:56,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-12-02 14:04:56,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-12-02 14:04:56,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 14:04:56,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:56,585 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:56,667 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 14:04:56,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:04:56,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:04:56 BasicIcfg [2024-12-02 14:04:56,673 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:04:56,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:04:56,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:04:56,674 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:04:56,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:04:46" (3/4) ... [2024-12-02 14:04:56,676 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 14:04:56,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:04:56,677 INFO L158 Benchmark]: Toolchain (without parser) took 11765.10ms. Allocated memory was 92.3MB in the beginning and 318.8MB in the end (delta: 226.5MB). Free memory was 68.3MB in the beginning and 128.6MB in the end (delta: -60.3MB). Peak memory consumption was 166.8MB. Max. memory is 16.1GB. [2024-12-02 14:04:56,677 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:04:56,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.41ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 44.2MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 14:04:56,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.43ms. Allocated memory is still 92.3MB. Free memory was 44.2MB in the beginning and 42.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:04:56,678 INFO L158 Benchmark]: Boogie Preprocessor took 69.30ms. Allocated memory is still 92.3MB. Free memory was 42.1MB in the beginning and 67.8MB in the end (delta: -25.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-12-02 14:04:56,678 INFO L158 Benchmark]: RCFGBuilder took 1461.78ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 67.8MB in the beginning and 108.0MB in the end (delta: -40.1MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2024-12-02 14:04:56,679 INFO L158 Benchmark]: TraceAbstraction took 9700.78ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 106.6MB in the beginning and 128.7MB in the end (delta: -22.0MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. [2024-12-02 14:04:56,679 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 318.8MB. Free memory was 128.7MB in the beginning and 128.6MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:04:56,681 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.36ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.41ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 44.2MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.43ms. Allocated memory is still 92.3MB. Free memory was 44.2MB in the beginning and 42.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.30ms. Allocated memory is still 92.3MB. Free memory was 42.1MB in the beginning and 67.8MB in the end (delta: -25.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1461.78ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 67.8MB in the beginning and 108.0MB in the end (delta: -40.1MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9700.78ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 106.6MB in the beginning and 128.7MB in the end (delta: -22.0MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 318.8MB. Free memory was 128.7MB in the beginning and 128.6MB in the end (delta: 62.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_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((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_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1937=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t1938; [L840] FCALL, FORK 0 pthread_create(&t1938, ((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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937=-2, t1938=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t1939; [L842] FCALL, FORK 0 pthread_create(&t1939, ((void *)0), P2, ((void *)0)) 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=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937=-2, t1938=-1, t1939=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 x = 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=0, __unbuffered_p2_EAX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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=0, __unbuffered_p2_EAX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L794] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \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=1, __unbuffered_p2_EAX=0, arg={0: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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [\old(arg)={0:0}, \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=1, __unbuffered_p2_EAX=0, arg={0: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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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=1, __unbuffered_p2_EAX=0, arg={0: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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L809] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \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=1, __unbuffered_p2_EAX=1, arg={0: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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [\old(arg)={0:0}, \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=1, __unbuffered_p2_EAX=1, arg={0: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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \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=1, __unbuffered_p2_EAX=1, arg={0: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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L822] 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=1, __unbuffered_p2_EAX=1, arg={0: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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 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=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1937=-2, t1938=-1, t1939=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\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=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1937=-2, t1938=-1, t1939=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1937=-2, t1938=-1, t1939=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L859] 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}, \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=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L18] 0 __assert_fail ("0", "safe007_power.oepc-thin001_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 842]: 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: 840]: 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, 116 locations, 55 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: 9.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 416 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 890 IncrementalHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 16 mSDtfsCounter, 890 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=11, InterpolantAutomatonStates: 49, 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.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 874 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1376 ConjunctsInSsa, 55 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-12-02 14:04:56,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f45af7-ef20-4c6e-acbe-e96048b2bf47/bin/uautomizer-verify-84ZbGMXZE1/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