./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.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_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:22:40,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:22:40,940 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 20:22:40,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:22:40,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:22:40,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:22:40,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:22:40,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:22:40,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:22:40,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:22:40,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:22:40,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:22:40,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:22:40,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:22:40,971 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:22:40,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:22:40,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:22:40,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:22:40,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:22:40,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:22:40,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:22:40,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:22:40,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:22:40,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:22:40,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:22:40,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:22:40,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:22:40,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:22:40,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:22:40,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:22:40,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:22:40,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:22:40,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:22:40,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:22:40,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:22:40,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:22:40,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:22:40,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:22:40,975 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_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2024-11-27 20:22:41,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:22:41,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:22:41,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:22:41,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:22:41,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:22:41,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-27 20:22:44,269 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data/2b6653f21/40b9a9202ea947a4902e9ee666dfe982/FLAG34c7b567f [2024-11-27 20:22:44,629 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:22:44,631 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-27 20:22:44,647 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data/2b6653f21/40b9a9202ea947a4902e9ee666dfe982/FLAG34c7b567f [2024-11-27 20:22:44,670 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data/2b6653f21/40b9a9202ea947a4902e9ee666dfe982 [2024-11-27 20:22:44,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:22:44,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:22:44,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:22:44,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:22:44,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:22:44,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:22:44" (1/1) ... [2024-11-27 20:22:44,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14045c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:44, skipping insertion in model container [2024-11-27 20:22:44,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:22:44" (1/1) ... [2024-11-27 20:22:44,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:22:45,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:22:45,153 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:22:45,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:22:45,260 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:22:45,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45 WrapperNode [2024-11-27 20:22:45,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:22:45,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:22:45,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:22:45,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:22:45,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,306 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-11-27 20:22:45,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:22:45,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:22:45,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:22:45,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:22:45,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,348 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:22:45,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,358 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:22:45,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:22:45,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:22:45,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:22:45,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (1/1) ... [2024-11-27 20:22:45,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:22:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:22:45,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:22:45,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:22:45,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 20:22:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:22:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 20:22:45,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 20:22:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 20:22:45,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 20:22:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-27 20:22:45,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-27 20:22:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:22:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 20:22:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:22:45,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:22:45,456 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:22:45,639 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:22:45,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:22:45,986 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:22:45,986 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:22:46,290 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:22:46,291 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 20:22:46,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:22:46 BoogieIcfgContainer [2024-11-27 20:22:46,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:22:46,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:22:46,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:22:46,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:22:46,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:22:44" (1/3) ... [2024-11-27 20:22:46,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dff3668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:22:46, skipping insertion in model container [2024-11-27 20:22:46,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:22:45" (2/3) ... [2024-11-27 20:22:46,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dff3668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:22:46, skipping insertion in model container [2024-11-27 20:22:46,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:22:46" (3/3) ... [2024-11-27 20:22:46,304 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-27 20:22:46,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:22:46,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-27 20:22:46,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:22:46,397 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:22:46,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-27 20:22:46,481 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-27 20:22:46,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:22:46,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-27 20:22:46,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-27 20:22:46,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-27 20:22:46,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:22:46,530 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;@2c4735ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:22:46,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-27 20:22:46,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:22:46,534 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-27 20:22:46,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:22:46,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:22:46,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-27 20:22:46,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:22:46,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash 11874970, now seen corresponding path program 1 times [2024-11-27 20:22:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:22:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922837587] [2024-11-27 20:22:46,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:22:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:22:47,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:22:47,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922837587] [2024-11-27 20:22:47,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922837587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:22:47,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:22:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:22:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834311625] [2024-11-27 20:22:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:22:47,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:22:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:22:47,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:22:47,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:22:47,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-27 20:22:47,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:47,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:22:47,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-27 20:22:47,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:22:47,802 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-27 20:22:47,802 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-27 20:22:47,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8166 event pairs, 104 based on Foata normal form. 72/1333 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-27 20:22:47,823 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-27 20:22:47,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-27 20:22:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:22:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:22:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-27 20:22:47,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-27 20:22:47,847 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-27 20:22:47,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-27 20:22:47,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:22:47,859 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-27 20:22:47,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-27 20:22:47,868 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-27 20:22:47,868 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-27 20:22:47,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:47,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:22:47,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:22:47,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:22:47,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:22:47,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash 625606107, now seen corresponding path program 1 times [2024-11-27 20:22:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:22:47,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316398994] [2024-11-27 20:22:47,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:22:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:22:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:22:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316398994] [2024-11-27 20:22:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316398994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:22:48,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:22:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:22:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522594552] [2024-11-27 20:22:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:22:48,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:22:48,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:22:48,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:22:48,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:22:48,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-27 20:22:48,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:48,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:22:48,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-27 20:22:48,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:22:48,388 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-11-27 20:22:48,388 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-27 20:22:48,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7018 event pairs, 605 based on Foata normal form. 36/1123 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-11-27 20:22:48,403 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-27 20:22:48,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-27 20:22:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:22:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:22:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-27 20:22:48,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-27 20:22:48,407 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-27 20:22:48,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-27 20:22:48,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:22:48,411 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-27 20:22:48,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-27 20:22:48,412 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-27 20:22:48,412 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-27 20:22:48,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:48,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:22:48,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:22:48,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:22:48,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:22:48,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash 625607718, now seen corresponding path program 1 times [2024-11-27 20:22:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:22:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184169666] [2024-11-27 20:22:48,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:22:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:22:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:22:49,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184169666] [2024-11-27 20:22:49,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184169666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:22:49,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:22:49,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:22:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175523227] [2024-11-27 20:22:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:22:49,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:22:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:22:49,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:22:49,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:22:49,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-27 20:22:49,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:49,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:22:49,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-27 20:22:49,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:22:51,476 INFO L124 PetriNetUnfolderBase]: 3181/5158 cut-off events. [2024-11-27 20:22:51,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:22:51,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9892 conditions, 5158 events. 3181/5158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 33096 event pairs, 392 based on Foata normal form. 0/5021 useless extension candidates. Maximal degree in co-relation 9886. Up to 2283 conditions per place. [2024-11-27 20:22:51,508 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 41 selfloop transitions, 12 changer transitions 90/153 dead transitions. [2024-11-27 20:22:51,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 153 transitions, 604 flow [2024-11-27 20:22:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:22:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-27 20:22:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 314 transitions. [2024-11-27 20:22:51,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5946969696969697 [2024-11-27 20:22:51,515 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 314 transitions. [2024-11-27 20:22:51,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 153 transitions, 604 flow [2024-11-27 20:22:51,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 153 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:22:51,520 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 213 flow [2024-11-27 20:22:51,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=213, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2024-11-27 20:22:51,522 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-11-27 20:22:51,523 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 213 flow [2024-11-27 20:22:51,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:51,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:22:51,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:22:51,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:22:51,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:22:51,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash 827570693, now seen corresponding path program 1 times [2024-11-27 20:22:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:22:51,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183218060] [2024-11-27 20:22:51,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:22:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:22:52,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:22:52,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183218060] [2024-11-27 20:22:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183218060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:22:52,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:22:52,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:22:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900912407] [2024-11-27 20:22:52,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:22:52,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:22:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:22:52,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:22:52,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:22:52,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-27 20:22:52,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:52,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:22:52,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-27 20:22:52,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:22:53,523 INFO L124 PetriNetUnfolderBase]: 2355/3922 cut-off events. [2024-11-27 20:22:53,524 INFO L125 PetriNetUnfolderBase]: For 8780/8783 co-relation queries the response was YES. [2024-11-27 20:22:53,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14278 conditions, 3922 events. 2355/3922 cut-off events. For 8780/8783 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 24816 event pairs, 500 based on Foata normal form. 99/4015 useless extension candidates. Maximal degree in co-relation 14260. Up to 2269 conditions per place. [2024-11-27 20:22:53,565 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 46 selfloop transitions, 19 changer transitions 54/129 dead transitions. [2024-11-27 20:22:53,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 129 transitions, 951 flow [2024-11-27 20:22:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:22:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-27 20:22:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions. [2024-11-27 20:22:53,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-11-27 20:22:53,570 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 213 flow. Second operand 10 states and 253 transitions. [2024-11-27 20:22:53,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 129 transitions, 951 flow [2024-11-27 20:22:53,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 129 transitions, 875 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-11-27 20:22:53,604 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 361 flow [2024-11-27 20:22:53,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-11-27 20:22:53,605 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2024-11-27 20:22:53,605 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 361 flow [2024-11-27 20:22:53,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:53,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:22:53,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:22:53,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:22:53,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:22:53,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 59559027, now seen corresponding path program 1 times [2024-11-27 20:22:53,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:22:53,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890845768] [2024-11-27 20:22:53,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:22:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:22:53,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:22:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890845768] [2024-11-27 20:22:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890845768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:22:53,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:22:53,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:22:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213307918] [2024-11-27 20:22:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:22:53,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:22:53,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:22:53,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:22:53,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:22:53,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-27 20:22:53,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:53,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:22:53,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-27 20:22:53,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:22:55,115 INFO L124 PetriNetUnfolderBase]: 2791/4724 cut-off events. [2024-11-27 20:22:55,115 INFO L125 PetriNetUnfolderBase]: For 16588/17316 co-relation queries the response was YES. [2024-11-27 20:22:55,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18998 conditions, 4724 events. 2791/4724 cut-off events. For 16588/17316 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 32211 event pairs, 663 based on Foata normal form. 392/4954 useless extension candidates. Maximal degree in co-relation 18973. Up to 2030 conditions per place. [2024-11-27 20:22:55,172 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 46 selfloop transitions, 6 changer transitions 47/118 dead transitions. [2024-11-27 20:22:55,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 1019 flow [2024-11-27 20:22:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:22:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 20:22:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-11-27 20:22:55,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5941558441558441 [2024-11-27 20:22:55,174 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 361 flow. Second operand 7 states and 183 transitions. [2024-11-27 20:22:55,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 1019 flow [2024-11-27 20:22:55,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 977 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-11-27 20:22:55,212 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 371 flow [2024-11-27 20:22:55,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=371, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2024-11-27 20:22:55,213 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2024-11-27 20:22:55,214 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 371 flow [2024-11-27 20:22:55,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:55,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:22:55,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:22:55,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:22:55,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:22:55,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1393230876, now seen corresponding path program 1 times [2024-11-27 20:22:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:22:55,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738861551] [2024-11-27 20:22:55,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:22:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:22:55,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:22:55,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738861551] [2024-11-27 20:22:55,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738861551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:22:55,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:22:55,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:22:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716659996] [2024-11-27 20:22:55,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:22:55,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:22:55,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:22:55,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:22:55,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:22:55,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-27 20:22:55,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:55,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:22:55,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-27 20:22:55,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:22:56,986 INFO L124 PetriNetUnfolderBase]: 3231/5480 cut-off events. [2024-11-27 20:22:56,986 INFO L125 PetriNetUnfolderBase]: For 17539/18594 co-relation queries the response was YES. [2024-11-27 20:22:57,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21658 conditions, 5480 events. 3231/5480 cut-off events. For 17539/18594 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38051 event pairs, 976 based on Foata normal form. 607/5881 useless extension candidates. Maximal degree in co-relation 21633. Up to 3591 conditions per place. [2024-11-27 20:22:57,034 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 37 selfloop transitions, 4 changer transitions 39/106 dead transitions. [2024-11-27 20:22:57,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 877 flow [2024-11-27 20:22:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:22:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 20:22:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-11-27 20:22:57,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5811688311688312 [2024-11-27 20:22:57,036 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 371 flow. Second operand 7 states and 179 transitions. [2024-11-27 20:22:57,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 877 flow [2024-11-27 20:22:57,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 855 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-27 20:22:57,102 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 417 flow [2024-11-27 20:22:57,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-11-27 20:22:57,103 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2024-11-27 20:22:57,103 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 417 flow [2024-11-27 20:22:57,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:57,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:22:57,104 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-11-27 20:22:57,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:22:57,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:22:57,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash 810999619, now seen corresponding path program 1 times [2024-11-27 20:22:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:22:57,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488422188] [2024-11-27 20:22:57,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:22:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:22:57,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:22:57,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488422188] [2024-11-27 20:22:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488422188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:22:57,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:22:57,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:22:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959989136] [2024-11-27 20:22:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:22:57,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:22:57,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:22:57,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:22:57,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:22:57,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-27 20:22:57,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:57,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:22:57,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-27 20:22:57,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:22:59,559 INFO L124 PetriNetUnfolderBase]: 4492/7749 cut-off events. [2024-11-27 20:22:59,559 INFO L125 PetriNetUnfolderBase]: For 25276/25308 co-relation queries the response was YES. [2024-11-27 20:22:59,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31852 conditions, 7749 events. 4492/7749 cut-off events. For 25276/25308 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 58000 event pairs, 985 based on Foata normal form. 196/7884 useless extension candidates. Maximal degree in co-relation 31825. Up to 2933 conditions per place. [2024-11-27 20:22:59,625 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 57 selfloop transitions, 21 changer transitions 55/144 dead transitions. [2024-11-27 20:22:59,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 144 transitions, 1290 flow [2024-11-27 20:22:59,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:22:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-27 20:22:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-11-27 20:22:59,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091 [2024-11-27 20:22:59,628 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 417 flow. Second operand 10 states and 246 transitions. [2024-11-27 20:22:59,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 144 transitions, 1290 flow [2024-11-27 20:22:59,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 144 transitions, 1267 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-27 20:22:59,676 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 607 flow [2024-11-27 20:22:59,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=607, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2024-11-27 20:22:59,677 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2024-11-27 20:22:59,677 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 607 flow [2024-11-27 20:22:59,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:22:59,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:22:59,678 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-11-27 20:22:59,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:22:59,678 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:22:59,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1542743980, now seen corresponding path program 1 times [2024-11-27 20:22:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:22:59,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172632903] [2024-11-27 20:22:59,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:59,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:22:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:00,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:00,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172632903] [2024-11-27 20:23:00,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172632903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:00,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:00,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:23:00,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285732050] [2024-11-27 20:23:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:00,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:23:00,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:00,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:23:00,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:23:00,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-27 20:23:00,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:00,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:00,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-27 20:23:00,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:01,323 INFO L124 PetriNetUnfolderBase]: 4122/7298 cut-off events. [2024-11-27 20:23:01,324 INFO L125 PetriNetUnfolderBase]: For 42892/44051 co-relation queries the response was YES. [2024-11-27 20:23:01,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33715 conditions, 7298 events. 4122/7298 cut-off events. For 42892/44051 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 55803 event pairs, 1856 based on Foata normal form. 634/7776 useless extension candidates. Maximal degree in co-relation 33680. Up to 4832 conditions per place. [2024-11-27 20:23:01,379 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 49 selfloop transitions, 14 changer transitions 42/132 dead transitions. [2024-11-27 20:23:01,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 132 transitions, 1473 flow [2024-11-27 20:23:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:23:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 20:23:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-27 20:23:01,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5823863636363636 [2024-11-27 20:23:01,381 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 607 flow. Second operand 8 states and 205 transitions. [2024-11-27 20:23:01,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 132 transitions, 1473 flow [2024-11-27 20:23:01,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 1415 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-27 20:23:01,460 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 721 flow [2024-11-27 20:23:01,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=721, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-11-27 20:23:01,463 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places. [2024-11-27 20:23:01,465 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 721 flow [2024-11-27 20:23:01,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:01,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:01,466 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-11-27 20:23:01,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:23:01,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:01,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1127372396, now seen corresponding path program 2 times [2024-11-27 20:23:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:01,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103635554] [2024-11-27 20:23:01,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:23:01,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:01,489 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:23:01,489 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:23:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:02,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103635554] [2024-11-27 20:23:02,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103635554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:02,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:02,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:23:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798762280] [2024-11-27 20:23:02,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:02,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:23:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:02,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:23:02,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:23:02,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-27 20:23:02,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 721 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:02,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:02,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-27 20:23:02,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:03,450 INFO L124 PetriNetUnfolderBase]: 3958/7012 cut-off events. [2024-11-27 20:23:03,450 INFO L125 PetriNetUnfolderBase]: For 46743/47730 co-relation queries the response was YES. [2024-11-27 20:23:03,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34259 conditions, 7012 events. 3958/7012 cut-off events. For 46743/47730 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 53324 event pairs, 1805 based on Foata normal form. 624/7481 useless extension candidates. Maximal degree in co-relation 34220. Up to 4749 conditions per place. [2024-11-27 20:23:03,498 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 45 selfloop transitions, 14 changer transitions 42/128 dead transitions. [2024-11-27 20:23:03,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 128 transitions, 1476 flow [2024-11-27 20:23:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:23:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 20:23:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-11-27 20:23:03,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5738636363636364 [2024-11-27 20:23:03,500 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 721 flow. Second operand 8 states and 202 transitions. [2024-11-27 20:23:03,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 128 transitions, 1476 flow [2024-11-27 20:23:03,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 128 transitions, 1424 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-27 20:23:03,601 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 739 flow [2024-11-27 20:23:03,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=739, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2024-11-27 20:23:03,604 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-27 20:23:03,604 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 739 flow [2024-11-27 20:23:03,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:03,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:03,605 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] [2024-11-27 20:23:03,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:23:03,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:03,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash -97355430, now seen corresponding path program 1 times [2024-11-27 20:23:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:03,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301942276] [2024-11-27 20:23:03,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:05,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:05,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301942276] [2024-11-27 20:23:05,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301942276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:05,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:05,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:23:05,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470858373] [2024-11-27 20:23:05,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:05,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:23:05,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:05,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:23:05,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:23:05,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-27 20:23:05,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:05,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:05,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-27 20:23:05,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:06,909 INFO L124 PetriNetUnfolderBase]: 4961/8462 cut-off events. [2024-11-27 20:23:06,910 INFO L125 PetriNetUnfolderBase]: For 57395/57418 co-relation queries the response was YES. [2024-11-27 20:23:06,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41506 conditions, 8462 events. 4961/8462 cut-off events. For 57395/57418 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 62179 event pairs, 1438 based on Foata normal form. 244/8701 useless extension candidates. Maximal degree in co-relation 41465. Up to 4922 conditions per place. [2024-11-27 20:23:06,957 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 68 selfloop transitions, 34 changer transitions 94/205 dead transitions. [2024-11-27 20:23:06,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 205 transitions, 2562 flow [2024-11-27 20:23:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:23:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-27 20:23:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-11-27 20:23:06,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-27 20:23:06,960 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 739 flow. Second operand 10 states and 242 transitions. [2024-11-27 20:23:06,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 205 transitions, 2562 flow [2024-11-27 20:23:07,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 205 transitions, 2492 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-11-27 20:23:07,085 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 1090 flow [2024-11-27 20:23:07,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1090, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2024-11-27 20:23:07,087 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 45 predicate places. [2024-11-27 20:23:07,088 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 1090 flow [2024-11-27 20:23:07,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:07,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:07,088 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] [2024-11-27 20:23:07,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:23:07,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:07,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:07,089 INFO L85 PathProgramCache]: Analyzing trace with hash -364931210, now seen corresponding path program 1 times [2024-11-27 20:23:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:07,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045655709] [2024-11-27 20:23:07,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:07,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:07,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045655709] [2024-11-27 20:23:07,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045655709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:07,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:07,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:23:07,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237187774] [2024-11-27 20:23:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:07,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:23:07,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:07,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:23:07,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:23:07,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-27 20:23:07,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 1090 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:07,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:07,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-27 20:23:07,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:07,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][63], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, 49#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 21#L759true, 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-27 20:23:07,647 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-27 20:23:07,647 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-27 20:23:07,647 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-27 20:23:07,648 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-27 20:23:07,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][84], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), 14#L762true, Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-27 20:23:07,771 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-27 20:23:07,771 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-27 20:23:07,772 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-27 20:23:07,772 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-27 20:23:07,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][84], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), 51#true, Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 38#P0EXITtrue, Black: 92#(= ~x~0 0), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-27 20:23:07,909 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-27 20:23:07,909 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-27 20:23:07,909 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-27 20:23:07,909 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-27 20:23:09,050 INFO L124 PetriNetUnfolderBase]: 6633/10569 cut-off events. [2024-11-27 20:23:09,050 INFO L125 PetriNetUnfolderBase]: For 97646/100947 co-relation queries the response was YES. [2024-11-27 20:23:09,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51675 conditions, 10569 events. 6633/10569 cut-off events. For 97646/100947 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 71253 event pairs, 1018 based on Foata normal form. 1950/12128 useless extension candidates. Maximal degree in co-relation 51629. Up to 5701 conditions per place. [2024-11-27 20:23:09,111 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 5 changer transitions 6/123 dead transitions. [2024-11-27 20:23:09,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 123 transitions, 1635 flow [2024-11-27 20:23:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:23:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:23:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-27 20:23:09,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-27 20:23:09,113 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 1090 flow. Second operand 4 states and 108 transitions. [2024-11-27 20:23:09,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 123 transitions, 1635 flow [2024-11-27 20:23:09,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 123 transitions, 1595 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-11-27 20:23:09,204 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 1019 flow [2024-11-27 20:23:09,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1019, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2024-11-27 20:23:09,204 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-27 20:23:09,204 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 1019 flow [2024-11-27 20:23:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:09,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:09,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:23:09,205 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2047113351, now seen corresponding path program 1 times [2024-11-27 20:23:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869295563] [2024-11-27 20:23:09,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:09,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:09,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869295563] [2024-11-27 20:23:09,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869295563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:09,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:09,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:23:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649329618] [2024-11-27 20:23:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:09,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:23:09,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:09,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:23:09,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:23:09,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-27 20:23:09,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 1019 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:09,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:09,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-27 20:23:09,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:09,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][63], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 250#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 21#L759true, 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-27 20:23:09,760 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-27 20:23:09,760 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-27 20:23:09,760 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-27 20:23:09,760 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-27 20:23:09,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][80], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 14#L762true, Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 252#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-27 20:23:09,847 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-27 20:23:09,847 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-27 20:23:09,847 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-27 20:23:09,847 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-27 20:23:09,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][80], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 252#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 38#P0EXITtrue, Black: 92#(= ~x~0 0), Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-27 20:23:09,952 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-27 20:23:09,952 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-27 20:23:09,952 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-27 20:23:09,952 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-27 20:23:10,454 INFO L124 PetriNetUnfolderBase]: 4618/7370 cut-off events. [2024-11-27 20:23:10,454 INFO L125 PetriNetUnfolderBase]: For 54185/56190 co-relation queries the response was YES. [2024-11-27 20:23:10,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34907 conditions, 7370 events. 4618/7370 cut-off events. For 54185/56190 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 47430 event pairs, 435 based on Foata normal form. 1272/8301 useless extension candidates. Maximal degree in co-relation 34863. Up to 2597 conditions per place. [2024-11-27 20:23:10,499 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 8 changer transitions 16/133 dead transitions. [2024-11-27 20:23:10,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 133 transitions, 1678 flow [2024-11-27 20:23:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:23:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:23:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-27 20:23:10,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-27 20:23:10,500 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 1019 flow. Second operand 5 states and 137 transitions. [2024-11-27 20:23:10,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 133 transitions, 1678 flow [2024-11-27 20:23:10,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 133 transitions, 1650 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-27 20:23:10,540 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 904 flow [2024-11-27 20:23:10,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=904, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2024-11-27 20:23:10,541 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 41 predicate places. [2024-11-27 20:23:10,541 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 904 flow [2024-11-27 20:23:10,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:10,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:10,542 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] [2024-11-27 20:23:10,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:23:10,542 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:10,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1030053428, now seen corresponding path program 1 times [2024-11-27 20:23:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236900455] [2024-11-27 20:23:10,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:10,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:11,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:11,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236900455] [2024-11-27 20:23:11,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236900455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:11,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:11,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:23:11,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979725560] [2024-11-27 20:23:11,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:11,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:23:11,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:11,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:23:11,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:23:11,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-27 20:23:11,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 904 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:11,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:11,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-27 20:23:11,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:12,832 INFO L124 PetriNetUnfolderBase]: 3248/6253 cut-off events. [2024-11-27 20:23:12,832 INFO L125 PetriNetUnfolderBase]: For 31534/33181 co-relation queries the response was YES. [2024-11-27 20:23:12,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27203 conditions, 6253 events. 3248/6253 cut-off events. For 31534/33181 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 50029 event pairs, 1073 based on Foata normal form. 489/6189 useless extension candidates. Maximal degree in co-relation 27172. Up to 2858 conditions per place. [2024-11-27 20:23:12,880 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 44 selfloop transitions, 19 changer transitions 38/139 dead transitions. [2024-11-27 20:23:12,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 139 transitions, 1585 flow [2024-11-27 20:23:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:23:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 20:23:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-11-27 20:23:12,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2024-11-27 20:23:12,882 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 904 flow. Second operand 9 states and 224 transitions. [2024-11-27 20:23:12,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 139 transitions, 1585 flow [2024-11-27 20:23:12,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 139 transitions, 1546 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-27 20:23:12,909 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 977 flow [2024-11-27 20:23:12,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=977, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2024-11-27 20:23:12,910 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2024-11-27 20:23:12,910 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 977 flow [2024-11-27 20:23:12,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:12,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:12,910 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] [2024-11-27 20:23:12,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:23:12,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:12,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1349137058, now seen corresponding path program 1 times [2024-11-27 20:23:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045224685] [2024-11-27 20:23:12,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045224685] [2024-11-27 20:23:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045224685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:13,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:13,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:23:13,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011501579] [2024-11-27 20:23:13,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:13,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:23:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:13,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:23:13,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:23:13,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-27 20:23:13,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:13,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:13,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-27 20:23:13,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:13,973 INFO L124 PetriNetUnfolderBase]: 3900/6494 cut-off events. [2024-11-27 20:23:13,973 INFO L125 PetriNetUnfolderBase]: For 57450/58703 co-relation queries the response was YES. [2024-11-27 20:23:14,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30586 conditions, 6494 events. 3900/6494 cut-off events. For 57450/58703 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 43629 event pairs, 396 based on Foata normal form. 881/7154 useless extension candidates. Maximal degree in co-relation 30550. Up to 2464 conditions per place. [2024-11-27 20:23:14,014 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 58 selfloop transitions, 11 changer transitions 30/120 dead transitions. [2024-11-27 20:23:14,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 1554 flow [2024-11-27 20:23:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:23:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:23:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-11-27 20:23:14,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-27 20:23:14,015 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 977 flow. Second operand 6 states and 150 transitions. [2024-11-27 20:23:14,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 120 transitions, 1554 flow [2024-11-27 20:23:14,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 1364 flow, removed 85 selfloop flow, removed 11 redundant places. [2024-11-27 20:23:14,083 INFO L231 Difference]: Finished difference. Result has 92 places, 64 transitions, 622 flow [2024-11-27 20:23:14,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=92, PETRI_TRANSITIONS=64} [2024-11-27 20:23:14,084 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 43 predicate places. [2024-11-27 20:23:14,084 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 64 transitions, 622 flow [2024-11-27 20:23:14,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:14,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:14,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:14,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:23:14,084 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:14,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1860468819, now seen corresponding path program 1 times [2024-11-27 20:23:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291353465] [2024-11-27 20:23:14,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291353465] [2024-11-27 20:23:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291353465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:15,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:15,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:23:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437191814] [2024-11-27 20:23:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:15,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:23:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:15,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:23:15,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:23:15,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-27 20:23:15,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 622 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:15,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:15,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-27 20:23:15,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:16,025 INFO L124 PetriNetUnfolderBase]: 843/1745 cut-off events. [2024-11-27 20:23:16,025 INFO L125 PetriNetUnfolderBase]: For 8026/8377 co-relation queries the response was YES. [2024-11-27 20:23:16,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6871 conditions, 1745 events. 843/1745 cut-off events. For 8026/8377 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11548 event pairs, 234 based on Foata normal form. 78/1647 useless extension candidates. Maximal degree in co-relation 6842. Up to 621 conditions per place. [2024-11-27 20:23:16,038 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 32 selfloop transitions, 6 changer transitions 23/89 dead transitions. [2024-11-27 20:23:16,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 831 flow [2024-11-27 20:23:16,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:23:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 20:23:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-27 20:23:16,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-11-27 20:23:16,039 INFO L175 Difference]: Start difference. First operand has 92 places, 64 transitions, 622 flow. Second operand 7 states and 166 transitions. [2024-11-27 20:23:16,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 831 flow [2024-11-27 20:23:16,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 670 flow, removed 46 selfloop flow, removed 16 redundant places. [2024-11-27 20:23:16,059 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 401 flow [2024-11-27 20:23:16,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2024-11-27 20:23:16,059 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places. [2024-11-27 20:23:16,059 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 401 flow [2024-11-27 20:23:16,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:16,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:16,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:16,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:23:16,060 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:16,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash -462981715, now seen corresponding path program 2 times [2024-11-27 20:23:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:16,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187209656] [2024-11-27 20:23:16,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:23:16,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:16,126 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:23:16,126 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 20:23:16,126 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:23:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:23:16,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:23:16,247 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:23:16,248 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-27 20:23:16,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-27 20:23:16,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-27 20:23:16,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-27 20:23:16,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-27 20:23:16,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-27 20:23:16,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-27 20:23:16,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 20:23:16,252 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:16,342 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 20:23:16,343 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:23:16,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:23:16 BasicIcfg [2024-11-27 20:23:16,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:23:16,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:23:16,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:23:16,354 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:23:16,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:22:46" (3/4) ... [2024-11-27 20:23:16,356 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:23:16,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:23:16,358 INFO L158 Benchmark]: Toolchain (without parser) took 31683.28ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 117.1MB in the beginning and 902.4MB in the end (delta: -785.3MB). Peak memory consumption was 519.1MB. Max. memory is 16.1GB. [2024-11-27 20:23:16,358 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 142.6MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:23:16,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.88ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 93.9MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:23:16,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.45ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:23:16,359 INFO L158 Benchmark]: Boogie Preprocessor took 59.46ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:23:16,359 INFO L158 Benchmark]: RCFGBuilder took 926.08ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 98.7MB in the end (delta: -10.4MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2024-11-27 20:23:16,360 INFO L158 Benchmark]: TraceAbstraction took 30056.83ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 98.1MB in the beginning and 902.6MB in the end (delta: -804.5MB). Peak memory consumption was 488.0MB. Max. memory is 16.1GB. [2024-11-27 20:23:16,360 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 1.4GB. Free memory was 902.6MB in the beginning and 902.4MB in the end (delta: 198.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:23:16,362 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.38ms. Allocated memory is still 142.6MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.88ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 93.9MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.45ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.46ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 926.08ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 98.7MB in the end (delta: -10.4MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30056.83ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 98.1MB in the beginning and 902.6MB in the end (delta: -804.5MB). Peak memory consumption was 488.0MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 1.4GB. Free memory was 902.6MB in the beginning and 902.4MB in the end (delta: 198.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, t2490=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 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) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 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 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 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) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 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 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 817]: 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, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 757 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2176 IncrementalHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 69 mSDtfsCounter, 2176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1090occurred in iteration=10, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 2375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:23:16,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:23:19,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:23:19,294 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-27 20:23:19,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:23:19,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:23:19,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:23:19,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:23:19,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:23:19,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:23:19,345 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:23:19,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:23:19,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:23:19,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:23:19,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:23:19,348 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:23:19,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:23:19,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:23:19,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:23:19,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:23:19,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:23:19,349 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:23:19,350 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:23:19,350 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:23:19,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:23:19,350 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:23:19,350 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:23:19,350 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:23:19,350 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:23:19,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:23:19,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:23:19,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:23:19,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:23:19,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:23:19,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:23:19,353 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:23:19,354 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:23:19,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:23:19,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:23:19,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:23:19,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:23:19,354 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_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2024-11-27 20:23:19,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:23:19,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:23:19,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:23:19,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:23:19,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:23:19,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-27 20:23:22,690 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data/003bfbe83/de2c85786b39495ea21cb664e6be882b/FLAG9641bd884 [2024-11-27 20:23:23,088 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:23:23,089 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-27 20:23:23,108 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data/003bfbe83/de2c85786b39495ea21cb664e6be882b/FLAG9641bd884 [2024-11-27 20:23:23,128 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/data/003bfbe83/de2c85786b39495ea21cb664e6be882b [2024-11-27 20:23:23,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:23:23,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:23:23,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:23:23,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:23:23,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:23:23,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37746b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23, skipping insertion in model container [2024-11-27 20:23:23,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:23:23,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:23:23,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:23:23,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:23:23,764 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:23:23,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23 WrapperNode [2024-11-27 20:23:23,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:23:23,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:23:23,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:23:23,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:23:23,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,823 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-27 20:23:23,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:23:23,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:23:23,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:23:23,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:23:23,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,866 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:23:23,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:23:23,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:23:23,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:23:23,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:23:23,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (1/1) ... [2024-11-27 20:23:23,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:23:23,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:23,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:23:23,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:23:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 20:23:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:23:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:23:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 20:23:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 20:23:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 20:23:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 20:23:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-27 20:23:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-27 20:23:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 20:23:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:23:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:23:23,995 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:23:24,200 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:23:24,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:23:24,572 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:23:24,572 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:23:24,951 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:23:24,954 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 20:23:24,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:23:24 BoogieIcfgContainer [2024-11-27 20:23:24,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:23:24,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:23:24,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:23:24,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:23:24,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:23:23" (1/3) ... [2024-11-27 20:23:24,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498750e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:23:24, skipping insertion in model container [2024-11-27 20:23:24,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:23" (2/3) ... [2024-11-27 20:23:24,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498750e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:23:24, skipping insertion in model container [2024-11-27 20:23:24,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:23:24" (3/3) ... [2024-11-27 20:23:24,968 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-27 20:23:24,987 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:23:24,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-27 20:23:24,989 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:23:25,080 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:23:25,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-27 20:23:25,190 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-27 20:23:25,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:23:25,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-27 20:23:25,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-27 20:23:25,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-27 20:23:25,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:23:25,230 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;@7dfc225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:23:25,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-27 20:23:25,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:23:25,236 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-27 20:23:25,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:23:25,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:25,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-27 20:23:25,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:25,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash 11936538, now seen corresponding path program 1 times [2024-11-27 20:23:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:25,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527811872] [2024-11-27 20:23:25,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:25,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:25,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:25,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:25,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:23:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:25,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:23:25,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:25,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:25,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527811872] [2024-11-27 20:23:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527811872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:25,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:25,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:23:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055389732] [2024-11-27 20:23:25,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:25,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:23:25,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:25,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:23:25,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:23:25,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-27 20:23:25,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:25,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:25,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-27 20:23:25,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:26,110 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-27 20:23:26,112 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-27 20:23:26,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8166 event pairs, 104 based on Foata normal form. 72/1333 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-27 20:23:26,131 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-27 20:23:26,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-27 20:23:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:23:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:23:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-27 20:23:26,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-27 20:23:26,152 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-27 20:23:26,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-27 20:23:26,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:23:26,164 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-27 20:23:26,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-27 20:23:26,172 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-27 20:23:26,172 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-27 20:23:26,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:26,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:26,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:26,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:23:26,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:26,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:26,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:26,379 INFO L85 PathProgramCache]: Analyzing trace with hash 18908189, now seen corresponding path program 1 times [2024-11-27 20:23:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:26,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866730203] [2024-11-27 20:23:26,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:26,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:26,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:26,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:26,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:23:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:26,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:23:26,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:26,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:26,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:26,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866730203] [2024-11-27 20:23:26,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866730203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:26,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:26,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:23:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687097347] [2024-11-27 20:23:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:26,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:23:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:26,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:23:26,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:23:26,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-27 20:23:26,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:26,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:26,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-27 20:23:26,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:26,810 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-11-27 20:23:26,810 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-27 20:23:26,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7018 event pairs, 605 based on Foata normal form. 36/1123 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-11-27 20:23:26,820 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-27 20:23:26,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-27 20:23:26,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:23:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:23:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-27 20:23:26,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-27 20:23:26,823 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-27 20:23:26,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-27 20:23:26,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:23:26,824 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-27 20:23:26,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-27 20:23:26,825 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-27 20:23:26,825 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-27 20:23:26,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:26,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:26,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:26,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:23:27,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:27,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:27,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash 18909800, now seen corresponding path program 1 times [2024-11-27 20:23:27,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:27,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221511915] [2024-11-27 20:23:27,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:27,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:27,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:27,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:27,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:23:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:27,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:23:27,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:27,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:27,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221511915] [2024-11-27 20:23:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221511915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:27,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:27,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:23:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561965873] [2024-11-27 20:23:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:27,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:23:27,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:27,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:23:27,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:23:27,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-27 20:23:27,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:27,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:27,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-27 20:23:27,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:27,717 INFO L124 PetriNetUnfolderBase]: 1363/2295 cut-off events. [2024-11-27 20:23:27,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:23:27,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 2295 events. 1363/2295 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 13820 event pairs, 149 based on Foata normal form. 80/2328 useless extension candidates. Maximal degree in co-relation 4407. Up to 1297 conditions per place. [2024-11-27 20:23:27,734 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-11-27 20:23:27,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 218 flow [2024-11-27 20:23:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:23:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:23:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-27 20:23:27,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-27 20:23:27,738 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 108 transitions. [2024-11-27 20:23:27,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 218 flow [2024-11-27 20:23:27,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:23:27,741 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2024-11-27 20:23:27,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-27 20:23:27,742 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-11-27 20:23:27,743 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2024-11-27 20:23:27,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:27,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:27,744 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-11-27 20:23:27,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 20:23:27,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:27,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:27,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:27,948 INFO L85 PathProgramCache]: Analyzing trace with hash 763898825, now seen corresponding path program 1 times [2024-11-27 20:23:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:27,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [755036981] [2024-11-27 20:23:27,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:27,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:27,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:27,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:27,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:23:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:28,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:23:28,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:28,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:28,132 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755036981] [2024-11-27 20:23:28,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755036981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:28,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:28,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:23:28,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508509777] [2024-11-27 20:23:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:23:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:28,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:23:28,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:23:28,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-27 20:23:28,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:28,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:28,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-27 20:23:28,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:28,541 INFO L124 PetriNetUnfolderBase]: 879/1511 cut-off events. [2024-11-27 20:23:28,543 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2024-11-27 20:23:28,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1511 events. 879/1511 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8068 event pairs, 75 based on Foata normal form. 68/1540 useless extension candidates. Maximal degree in co-relation 3431. Up to 625 conditions per place. [2024-11-27 20:23:28,554 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-27 20:23:28,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 314 flow [2024-11-27 20:23:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:23:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:23:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-27 20:23:28,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-27 20:23:28,556 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 136 transitions. [2024-11-27 20:23:28,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 314 flow [2024-11-27 20:23:28,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 20:23:28,561 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2024-11-27 20:23:28,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-27 20:23:28,563 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-11-27 20:23:28,563 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2024-11-27 20:23:28,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:28,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:28,564 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-11-27 20:23:28,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:23:28,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:28,768 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:28,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1947523095, now seen corresponding path program 1 times [2024-11-27 20:23:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:28,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728710041] [2024-11-27 20:23:28,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:28,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:28,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:28,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:28,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:23:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:28,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:23:28,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:28,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:28,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:28,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728710041] [2024-11-27 20:23:28,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728710041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:28,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:28,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:23:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503459121] [2024-11-27 20:23:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:28,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:23:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:28,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:23:28,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:23:28,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-27 20:23:28,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:28,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:28,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-27 20:23:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:29,362 INFO L124 PetriNetUnfolderBase]: 491/839 cut-off events. [2024-11-27 20:23:29,362 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-11-27 20:23:29,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 839 events. 491/839 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3707 event pairs, 61 based on Foata normal form. 36/841 useless extension candidates. Maximal degree in co-relation 2167. Up to 268 conditions per place. [2024-11-27 20:23:29,367 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-11-27 20:23:29,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 325 flow [2024-11-27 20:23:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:23:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:23:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-27 20:23:29,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-27 20:23:29,370 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 148 transitions. [2024-11-27 20:23:29,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 325 flow [2024-11-27 20:23:29,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-27 20:23:29,376 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2024-11-27 20:23:29,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-11-27 20:23:29,377 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-27 20:23:29,377 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2024-11-27 20:23:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:29,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:29,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:29,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 20:23:29,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:29,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:29,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1445209619, now seen corresponding path program 1 times [2024-11-27 20:23:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:29,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388175392] [2024-11-27 20:23:29,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:29,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:29,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:29,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:29,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:23:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:29,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-27 20:23:29,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:30,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:30,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388175392] [2024-11-27 20:23:30,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388175392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:30,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:30,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:23:30,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913997009] [2024-11-27 20:23:30,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:30,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:23:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:30,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:23:30,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:23:30,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-27 20:23:30,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:30,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:30,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-27 20:23:30,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:30,780 INFO L124 PetriNetUnfolderBase]: 505/962 cut-off events. [2024-11-27 20:23:30,780 INFO L125 PetriNetUnfolderBase]: For 390/411 co-relation queries the response was YES. [2024-11-27 20:23:30,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 962 events. 505/962 cut-off events. For 390/411 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4898 event pairs, 201 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 2205. Up to 484 conditions per place. [2024-11-27 20:23:30,786 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 25 selfloop transitions, 4 changer transitions 14/62 dead transitions. [2024-11-27 20:23:30,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 305 flow [2024-11-27 20:23:30,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:23:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 20:23:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-27 20:23:30,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-11-27 20:23:30,788 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 7 states and 163 transitions. [2024-11-27 20:23:30,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 305 flow [2024-11-27 20:23:30,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 238 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-27 20:23:30,793 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 134 flow [2024-11-27 20:23:30,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-27 20:23:30,794 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-27 20:23:30,794 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 134 flow [2024-11-27 20:23:30,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:30,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:30,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:30,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:23:30,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:30,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:30,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1188579421, now seen corresponding path program 2 times [2024-11-27 20:23:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:30,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015134174] [2024-11-27 20:23:30,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:23:30,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:30,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:31,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:31,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:23:31,103 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:23:31,104 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:23:31,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-27 20:23:31,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:31,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:31,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:31,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015134174] [2024-11-27 20:23:31,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015134174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:31,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:31,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:23:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903722257] [2024-11-27 20:23:31,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:31,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:23:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:31,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:23:31,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:23:31,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-27 20:23:31,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 134 flow. Second operand has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:31,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:31,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-27 20:23:31,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:32,143 INFO L124 PetriNetUnfolderBase]: 573/1092 cut-off events. [2024-11-27 20:23:32,144 INFO L125 PetriNetUnfolderBase]: For 206/215 co-relation queries the response was YES. [2024-11-27 20:23:32,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2392 conditions, 1092 events. 573/1092 cut-off events. For 206/215 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5843 event pairs, 239 based on Foata normal form. 8/1032 useless extension candidates. Maximal degree in co-relation 2380. Up to 404 conditions per place. [2024-11-27 20:23:32,150 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 24 selfloop transitions, 4 changer transitions 16/63 dead transitions. [2024-11-27 20:23:32,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 273 flow [2024-11-27 20:23:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:23:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 20:23:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-27 20:23:32,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-11-27 20:23:32,152 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 134 flow. Second operand 7 states and 163 transitions. [2024-11-27 20:23:32,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 273 flow [2024-11-27 20:23:32,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 258 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-27 20:23:32,157 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 142 flow [2024-11-27 20:23:32,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-11-27 20:23:32,158 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-27 20:23:32,162 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 142 flow [2024-11-27 20:23:32,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:32,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:32,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:32,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 20:23:32,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:32,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:32,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash 50392787, now seen corresponding path program 3 times [2024-11-27 20:23:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:32,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542547254] [2024-11-27 20:23:32,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:23:32,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:32,369 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:32,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:23:32,469 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 20:23:32,469 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:23:32,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:23:32,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:32,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:32,713 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:32,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542547254] [2024-11-27 20:23:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542547254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:32,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:32,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:23:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651695694] [2024-11-27 20:23:32,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:32,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:23:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:32,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:23:32,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:23:32,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-27 20:23:32,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:32,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:32,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-27 20:23:32,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:33,075 INFO L124 PetriNetUnfolderBase]: 657/1209 cut-off events. [2024-11-27 20:23:33,075 INFO L125 PetriNetUnfolderBase]: For 318/351 co-relation queries the response was YES. [2024-11-27 20:23:33,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 1209 events. 657/1209 cut-off events. For 318/351 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6523 event pairs, 305 based on Foata normal form. 12/1137 useless extension candidates. Maximal degree in co-relation 2764. Up to 603 conditions per place. [2024-11-27 20:23:33,082 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 31 selfloop transitions, 2 changer transitions 19/70 dead transitions. [2024-11-27 20:23:33,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 329 flow [2024-11-27 20:23:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:23:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:23:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-27 20:23:33,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242 [2024-11-27 20:23:33,087 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 142 flow. Second operand 6 states and 145 transitions. [2024-11-27 20:23:33,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 329 flow [2024-11-27 20:23:33,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 299 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-27 20:23:33,091 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 138 flow [2024-11-27 20:23:33,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-11-27 20:23:33,093 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-27 20:23:33,093 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 138 flow [2024-11-27 20:23:33,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:33,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:33,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:33,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 20:23:33,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:33,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:33,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:33,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1799298273, now seen corresponding path program 4 times [2024-11-27 20:23:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:33,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231431518] [2024-11-27 20:23:33,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 20:23:33,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:33,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:33,303 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:33,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:23:33,390 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 20:23:33,390 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:23:33,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:23:33,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:33,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:33,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:33,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231431518] [2024-11-27 20:23:33,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231431518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:33,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:33,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:23:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698787420] [2024-11-27 20:23:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:33,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:23:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:33,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:23:33,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:23:33,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-27 20:23:33,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:33,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:23:33,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-27 20:23:33,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:23:33,767 INFO L124 PetriNetUnfolderBase]: 497/946 cut-off events. [2024-11-27 20:23:33,768 INFO L125 PetriNetUnfolderBase]: For 251/255 co-relation queries the response was YES. [2024-11-27 20:23:33,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 946 events. 497/946 cut-off events. For 251/255 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4575 event pairs, 201 based on Foata normal form. 12/924 useless extension candidates. Maximal degree in co-relation 2058. Up to 409 conditions per place. [2024-11-27 20:23:33,772 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 27 selfloop transitions, 2 changer transitions 21/68 dead transitions. [2024-11-27 20:23:33,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 309 flow [2024-11-27 20:23:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:23:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:23:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-11-27 20:23:33,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-27 20:23:33,774 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 138 flow. Second operand 6 states and 143 transitions. [2024-11-27 20:23:33,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 309 flow [2024-11-27 20:23:33,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 291 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-27 20:23:33,777 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 140 flow [2024-11-27 20:23:33,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-27 20:23:33,778 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-27 20:23:33,778 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 140 flow [2024-11-27 20:23:33,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:23:33,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:23:33,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:33,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 20:23:33,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:33,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:23:33,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1880925251, now seen corresponding path program 5 times [2024-11-27 20:23:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:33,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281316394] [2024-11-27 20:23:33,985 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 20:23:33,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:33,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:33,987 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:33,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:23:34,091 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:23:34,092 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 20:23:34,092 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:23:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:23:34,190 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-27 20:23:34,190 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:23:34,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-27 20:23:34,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-27 20:23:34,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-27 20:23:34,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-27 20:23:34,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-27 20:23:34,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-27 20:23:34,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-27 20:23:34,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:23:34,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:34,396 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-27 20:23:34,517 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 20:23:34,517 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:23:34,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:23:34 BasicIcfg [2024-11-27 20:23:34,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:23:34,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:23:34,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:23:34,523 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:23:34,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:23:24" (3/4) ... [2024-11-27 20:23:34,526 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:23:34,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:23:34,528 INFO L158 Benchmark]: Toolchain (without parser) took 11395.82ms. Allocated memory was 83.9MB in the beginning and 243.3MB in the end (delta: 159.4MB). Free memory was 59.7MB in the beginning and 206.9MB in the end (delta: -147.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-27 20:23:34,528 INFO L158 Benchmark]: CDTParser took 3.12ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:23:34,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.04ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 36.4MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:23:34,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.59ms. Allocated memory is still 83.9MB. Free memory was 36.4MB in the beginning and 33.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:23:34,529 INFO L158 Benchmark]: Boogie Preprocessor took 76.63ms. Allocated memory is still 83.9MB. Free memory was 33.5MB in the beginning and 30.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:23:34,529 INFO L158 Benchmark]: RCFGBuilder took 1053.39ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 30.6MB in the beginning and 112.2MB in the end (delta: -81.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-27 20:23:34,530 INFO L158 Benchmark]: TraceAbstraction took 9564.40ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 111.3MB in the beginning and 206.9MB in the end (delta: -95.6MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2024-11-27 20:23:34,530 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 243.3MB. Free memory was 206.9MB in the beginning and 206.9MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:23:34,532 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.12ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.04ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 36.4MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.59ms. Allocated memory is still 83.9MB. Free memory was 36.4MB in the beginning and 33.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.63ms. Allocated memory is still 83.9MB. Free memory was 33.5MB in the beginning and 30.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1053.39ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 30.6MB in the beginning and 112.2MB in the end (delta: -81.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9564.40ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 111.3MB in the beginning and 206.9MB in the end (delta: -95.6MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 243.3MB. Free memory was 206.9MB in the beginning and 206.9MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-2, t2490=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 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) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 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 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 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) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 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 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 817]: 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, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 994 IncrementalHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 20 mSDtfsCounter, 994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=5, 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.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 229 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1005 SizeOfPredicates, 25 NumberOfNonLiveVariables, 935 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:23:34,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed8a3406-86ad-4c61-a243-d94de8caa09e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample