./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX --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 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:35:50,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:35:50,192 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 18:35:50,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:35:50,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:35:50,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:35:50,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:35:50,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:35:50,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:35:50,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:35:50,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:35:50,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:35:50,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:35:50,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:35:50,242 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:35:50,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:35:50,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:35:50,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:35:50,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:35:50,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:35:50,244 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:35:50,249 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:35:50,249 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:35:50,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:35:50,249 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:35:50,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:35:50,250 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:35:50,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:35:50,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:35:50,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:35:50,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:35:50,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:35:50,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:35:50,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:35:50,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:35:50,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:35:50,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:35:50,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:35:50,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:35:50,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:35:50,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:35:50,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:35:50,255 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX 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 -> 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 [2024-11-08 18:35:50,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:35:50,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:35:50,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:35:50,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:35:50,571 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:35:50,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-08 18:35:52,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:35:53,007 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:35:53,008 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-11-08 18:35:53,027 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/data/ee8734adf/265cb878d1494d9ca3b4f9b2c29396c7/FLAG58f4bb5c6 [2024-11-08 18:35:53,045 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/data/ee8734adf/265cb878d1494d9ca3b4f9b2c29396c7 [2024-11-08 18:35:53,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:35:53,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:35:53,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:35:53,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:35:53,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:35:53,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:53,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647c3084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53, skipping insertion in model container [2024-11-08 18:35:53,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:53,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:35:53,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:35:53,841 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:35:53,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:35:53,983 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:35:53,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53 WrapperNode [2024-11-08 18:35:53,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:35:53,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:35:53,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:35:53,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:35:53,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,060 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123 [2024-11-08 18:35:54,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:35:54,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:35:54,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:35:54,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:35:54,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,105 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-08 18:35:54,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:35:54,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:35:54,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:35:54,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:35:54,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (1/1) ... [2024-11-08 18:35:54,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:35:54,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:35:54,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:35:54,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:35:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 18:35:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:35:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-08 18:35:54,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-08 18:35:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-08 18:35:54,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-08 18:35:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-08 18:35:54,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-08 18:35:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:35:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 18:35:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:35:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:35:54,258 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:35:54,512 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:35:54,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:35:55,028 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:35:55,028 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:35:55,411 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:35:55,411 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:35:55,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:35:55 BoogieIcfgContainer [2024-11-08 18:35:55,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:35:55,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:35:55,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:35:55,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:35:55,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:35:53" (1/3) ... [2024-11-08 18:35:55,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6d78d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:35:55, skipping insertion in model container [2024-11-08 18:35:55,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:53" (2/3) ... [2024-11-08 18:35:55,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6d78d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:35:55, skipping insertion in model container [2024-11-08 18:35:55,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:35:55" (3/3) ... [2024-11-08 18:35:55,436 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-11-08 18:35:55,466 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:35:55,468 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-08 18:35:55,468 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:35:55,547 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 18:35:55,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2024-11-08 18:35:55,652 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2024-11-08 18:35:55,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:35:55,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-11-08 18:35:55,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2024-11-08 18:35:55,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2024-11-08 18:35:55,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:35:55,708 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;@12b79486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:35:55,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 18:35:55,714 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:35:55,715 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-08 18:35:55,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:35:55,716 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:35:55,716 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-08 18:35:55,718 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-08 18:35:55,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash 12494494, now seen corresponding path program 1 times [2024-11-08 18:35:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:55,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544994528] [2024-11-08 18:35:55,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:56,300 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-08 18:35:56,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:56,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544994528] [2024-11-08 18:35:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544994528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:56,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:56,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:35:56,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382949888] [2024-11-08 18:35:56,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:56,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:35:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:56,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:35:56,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:35:56,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-11-08 18:35:56,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-08 18:35:56,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:35:56,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-11-08 18:35:56,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:35:57,020 INFO L124 PetriNetUnfolderBase]: 825/1461 cut-off events. [2024-11-08 18:35:57,020 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-08 18:35:57,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1461 events. 825/1461 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8995 event pairs, 457 based on Foata normal form. 96/1530 useless extension candidates. Maximal degree in co-relation 2731. Up to 1009 conditions per place. [2024-11-08 18:35:57,046 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 33 selfloop transitions, 2 changer transitions 2/57 dead transitions. [2024-11-08 18:35:57,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 203 flow [2024-11-08 18:35:57,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:35:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:35:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-08 18:35:57,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-11-08 18:35:57,067 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 111 transitions. [2024-11-08 18:35:57,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 203 flow [2024-11-08 18:35:57,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 18:35:57,077 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2024-11-08 18:35:57,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-08 18:35:57,087 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-11-08 18:35:57,088 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2024-11-08 18:35:57,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-08 18:35:57,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:35:57,089 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:57,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:35:57,090 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-08 18:35:57,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash -777583259, now seen corresponding path program 1 times [2024-11-08 18:35:57,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:57,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431285057] [2024-11-08 18:35:57,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:57,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:57,238 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-08 18:35:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431285057] [2024-11-08 18:35:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431285057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:57,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:35:57,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310165157] [2024-11-08 18:35:57,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:57,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:35:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:57,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:35:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:35:57,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-11-08 18:35:57,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-08 18:35:57,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:35:57,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-11-08 18:35:57,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:35:57,640 INFO L124 PetriNetUnfolderBase]: 721/1405 cut-off events. [2024-11-08 18:35:57,641 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-08 18:35:57,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 1405 events. 721/1405 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9435 event pairs, 721 based on Foata normal form. 48/1371 useless extension candidates. Maximal degree in co-relation 2615. Up to 1090 conditions per place. [2024-11-08 18:35:57,652 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 18 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-08 18:35:57,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 128 flow [2024-11-08 18:35:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:35:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:35:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-08 18:35:57,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-11-08 18:35:57,656 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 87 transitions. [2024-11-08 18:35:57,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 128 flow [2024-11-08 18:35:57,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:35:57,658 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2024-11-08 18:35:57,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-08 18:35:57,662 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-11-08 18:35:57,662 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2024-11-08 18:35:57,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-08 18:35:57,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:35:57,662 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:57,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:35:57,663 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-08 18:35:57,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash -777581772, now seen corresponding path program 1 times [2024-11-08 18:35:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265467130] [2024-11-08 18:35:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:58,074 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-08 18:35:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:58,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265467130] [2024-11-08 18:35:58,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265467130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:58,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:58,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:35:58,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949003259] [2024-11-08 18:35:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:58,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:35:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:35:58,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:35:58,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-08 18:35:58,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-08 18:35:58,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:35:58,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-08 18:35:58,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:00,165 INFO L124 PetriNetUnfolderBase]: 5830/9348 cut-off events. [2024-11-08 18:36:00,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:36:00,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17972 conditions, 9348 events. 5830/9348 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 65676 event pairs, 1364 based on Foata normal form. 0/9012 useless extension candidates. Maximal degree in co-relation 17966. Up to 3832 conditions per place. [2024-11-08 18:36:00,216 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 38 selfloop transitions, 7 changer transitions 83/140 dead transitions. [2024-11-08 18:36:00,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 140 transitions, 546 flow [2024-11-08 18:36:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:36:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 18:36:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 274 transitions. [2024-11-08 18:36:00,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6342592592592593 [2024-11-08 18:36:00,222 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 9 states and 274 transitions. [2024-11-08 18:36:00,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 140 transitions, 546 flow [2024-11-08 18:36:00,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 140 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:36:00,228 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 179 flow [2024-11-08 18:36:00,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-11-08 18:36:00,229 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2024-11-08 18:36:00,230 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 179 flow [2024-11-08 18:36:00,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-08 18:36:00,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:00,231 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:00,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:36:00,232 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-08 18:36:00,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash 501162159, now seen corresponding path program 1 times [2024-11-08 18:36:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:00,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107793693] [2024-11-08 18:36:00,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:00,484 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-08 18:36:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107793693] [2024-11-08 18:36:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107793693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:36:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572905826] [2024-11-08 18:36:00,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:00,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:36:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:00,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:36:00,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:36:00,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-08 18:36:00,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:36:00,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:00,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-08 18:36:00,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:02,321 INFO L124 PetriNetUnfolderBase]: 4127/6794 cut-off events. [2024-11-08 18:36:02,322 INFO L125 PetriNetUnfolderBase]: For 8800/8936 co-relation queries the response was YES. [2024-11-08 18:36:02,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19916 conditions, 6794 events. 4127/6794 cut-off events. For 8800/8936 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 46296 event pairs, 647 based on Foata normal form. 233/6996 useless extension candidates. Maximal degree in co-relation 19901. Up to 2655 conditions per place. [2024-11-08 18:36:02,395 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 52 selfloop transitions, 7 changer transitions 72/143 dead transitions. [2024-11-08 18:36:02,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 143 transitions, 879 flow [2024-11-08 18:36:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:36:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 18:36:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 281 transitions. [2024-11-08 18:36:02,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5854166666666667 [2024-11-08 18:36:02,398 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 179 flow. Second operand 10 states and 281 transitions. [2024-11-08 18:36:02,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 143 transitions, 879 flow [2024-11-08 18:36:02,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 143 transitions, 765 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-11-08 18:36:02,434 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 221 flow [2024-11-08 18:36:02,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=221, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2024-11-08 18:36:02,435 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2024-11-08 18:36:02,436 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 221 flow [2024-11-08 18:36:02,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:36:02,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:02,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:02,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:36:02,437 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-08 18:36:02,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1430977742, now seen corresponding path program 1 times [2024-11-08 18:36:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762678849] [2024-11-08 18:36:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:02,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:02,759 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-08 18:36:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762678849] [2024-11-08 18:36:02,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762678849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:02,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:02,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:36:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20362532] [2024-11-08 18:36:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:02,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:36:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:02,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:36:02,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:36:02,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-08 18:36:02,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-08 18:36:02,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:02,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-08 18:36:02,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:04,632 INFO L124 PetriNetUnfolderBase]: 3582/5954 cut-off events. [2024-11-08 18:36:04,632 INFO L125 PetriNetUnfolderBase]: For 11186/11463 co-relation queries the response was YES. [2024-11-08 18:36:04,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17945 conditions, 5954 events. 3582/5954 cut-off events. For 11186/11463 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 38814 event pairs, 534 based on Foata normal form. 161/6062 useless extension candidates. Maximal degree in co-relation 17923. Up to 2621 conditions per place. [2024-11-08 18:36:04,707 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 49 selfloop transitions, 11 changer transitions 60/132 dead transitions. [2024-11-08 18:36:04,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 132 transitions, 841 flow [2024-11-08 18:36:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:36:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 18:36:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-11-08 18:36:04,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5645833333333333 [2024-11-08 18:36:04,711 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 221 flow. Second operand 10 states and 271 transitions. [2024-11-08 18:36:04,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 132 transitions, 841 flow [2024-11-08 18:36:04,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 132 transitions, 788 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-11-08 18:36:04,812 INFO L231 Difference]: Finished difference. Result has 76 places, 51 transitions, 313 flow [2024-11-08 18:36:04,814 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=313, PETRI_PLACES=76, PETRI_TRANSITIONS=51} [2024-11-08 18:36:04,816 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2024-11-08 18:36:04,818 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 51 transitions, 313 flow [2024-11-08 18:36:04,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-08 18:36:04,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:04,819 INFO L204 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] [2024-11-08 18:36:04,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:36:04,819 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-08 18:36:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -521663224, now seen corresponding path program 1 times [2024-11-08 18:36:04,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:04,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737883528] [2024-11-08 18:36:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:05,029 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-08 18:36:05,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737883528] [2024-11-08 18:36:05,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737883528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:05,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:05,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:36:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729687785] [2024-11-08 18:36:05,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:05,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:36:05,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:05,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:36:05,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:36:05,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-08 18:36:05,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 51 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-08 18:36:05,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:05,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-08 18:36:05,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:06,708 INFO L124 PetriNetUnfolderBase]: 3997/6770 cut-off events. [2024-11-08 18:36:06,708 INFO L125 PetriNetUnfolderBase]: For 7596/7840 co-relation queries the response was YES. [2024-11-08 18:36:06,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17212 conditions, 6770 events. 3997/6770 cut-off events. For 7596/7840 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 45217 event pairs, 712 based on Foata normal form. 388/6920 useless extension candidates. Maximal degree in co-relation 17184. Up to 3421 conditions per place. [2024-11-08 18:36:06,799 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 49 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2024-11-08 18:36:06,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 539 flow [2024-11-08 18:36:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:36:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 18:36:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-11-08 18:36:06,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-08 18:36:06,802 INFO L175 Difference]: Start difference. First operand has 76 places, 51 transitions, 313 flow. Second operand 4 states and 126 transitions. [2024-11-08 18:36:06,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 539 flow [2024-11-08 18:36:06,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 501 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-11-08 18:36:06,869 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 321 flow [2024-11-08 18:36:06,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-11-08 18:36:06,870 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2024-11-08 18:36:06,871 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 321 flow [2024-11-08 18:36:06,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-08 18:36:06,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:06,872 INFO L204 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] [2024-11-08 18:36:06,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:36:06,873 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-08 18:36:06,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:06,873 INFO L85 PathProgramCache]: Analyzing trace with hash -691142515, now seen corresponding path program 1 times [2024-11-08 18:36:06,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897585168] [2024-11-08 18:36:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:07,159 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-08 18:36:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:07,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897585168] [2024-11-08 18:36:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897585168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:07,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:07,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:36:07,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950835718] [2024-11-08 18:36:07,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:07,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:36:07,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:07,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:36:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:36:07,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-08 18:36:07,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:36:07,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:07,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-08 18:36:07,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:08,051 INFO L124 PetriNetUnfolderBase]: 2850/4901 cut-off events. [2024-11-08 18:36:08,051 INFO L125 PetriNetUnfolderBase]: For 4000/4100 co-relation queries the response was YES. [2024-11-08 18:36:08,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13493 conditions, 4901 events. 2850/4901 cut-off events. For 4000/4100 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 31004 event pairs, 475 based on Foata normal form. 271/4954 useless extension candidates. Maximal degree in co-relation 13468. Up to 1554 conditions per place. [2024-11-08 18:36:08,116 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 61 selfloop transitions, 8 changer transitions 0/95 dead transitions. [2024-11-08 18:36:08,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 95 transitions, 616 flow [2024-11-08 18:36:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:36:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:36:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-11-08 18:36:08,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-08 18:36:08,118 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 321 flow. Second operand 5 states and 160 transitions. [2024-11-08 18:36:08,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 95 transitions, 616 flow [2024-11-08 18:36:08,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 605 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-08 18:36:08,128 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 365 flow [2024-11-08 18:36:08,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2024-11-08 18:36:08,129 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2024-11-08 18:36:08,129 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 365 flow [2024-11-08 18:36:08,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:36:08,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:08,130 INFO L204 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] [2024-11-08 18:36:08,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:36:08,130 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-08 18:36:08,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1698806424, now seen corresponding path program 1 times [2024-11-08 18:36:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:08,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2997469] [2024-11-08 18:36:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:08,623 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-08 18:36:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:08,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2997469] [2024-11-08 18:36:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2997469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:08,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:36:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932191230] [2024-11-08 18:36:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:08,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:36:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:08,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:36:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:36:08,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-08 18:36:08,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-08 18:36:08,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:08,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-08 18:36:08,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:09,351 INFO L124 PetriNetUnfolderBase]: 2322/3941 cut-off events. [2024-11-08 18:36:09,351 INFO L125 PetriNetUnfolderBase]: For 6380/6452 co-relation queries the response was YES. [2024-11-08 18:36:09,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12320 conditions, 3941 events. 2322/3941 cut-off events. For 6380/6452 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 24349 event pairs, 449 based on Foata normal form. 117/3839 useless extension candidates. Maximal degree in co-relation 12296. Up to 1554 conditions per place. [2024-11-08 18:36:09,373 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 53 selfloop transitions, 11 changer transitions 1/91 dead transitions. [2024-11-08 18:36:09,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 610 flow [2024-11-08 18:36:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:36:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:36:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2024-11-08 18:36:09,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-08 18:36:09,375 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 365 flow. Second operand 6 states and 176 transitions. [2024-11-08 18:36:09,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 610 flow [2024-11-08 18:36:09,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 581 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-08 18:36:09,383 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 381 flow [2024-11-08 18:36:09,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2024-11-08 18:36:09,384 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-11-08 18:36:09,384 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 381 flow [2024-11-08 18:36:09,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-08 18:36:09,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:09,385 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:09,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:36:09,385 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-08 18:36:09,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1754466161, now seen corresponding path program 1 times [2024-11-08 18:36:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:09,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498911334] [2024-11-08 18:36:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:10,865 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-08 18:36:10,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:10,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498911334] [2024-11-08 18:36:10,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498911334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:10,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:10,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:36:10,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506007335] [2024-11-08 18:36:10,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:10,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:36:10,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:36:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:36:10,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-08 18:36:10,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 381 flow. Second operand has 9 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 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-08 18:36:10,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:10,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-08 18:36:10,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:11,801 INFO L124 PetriNetUnfolderBase]: 1919/4015 cut-off events. [2024-11-08 18:36:11,801 INFO L125 PetriNetUnfolderBase]: For 6887/7450 co-relation queries the response was YES. [2024-11-08 18:36:11,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11889 conditions, 4015 events. 1919/4015 cut-off events. For 6887/7450 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32496 event pairs, 622 based on Foata normal form. 61/3635 useless extension candidates. Maximal degree in co-relation 11865. Up to 1261 conditions per place. [2024-11-08 18:36:11,839 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 36 selfloop transitions, 10 changer transitions 22/106 dead transitions. [2024-11-08 18:36:11,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 106 transitions, 673 flow [2024-11-08 18:36:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:36:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 18:36:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 254 transitions. [2024-11-08 18:36:11,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5879629629629629 [2024-11-08 18:36:11,841 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 381 flow. Second operand 9 states and 254 transitions. [2024-11-08 18:36:11,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 106 transitions, 673 flow [2024-11-08 18:36:11,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 621 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-08 18:36:11,890 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 397 flow [2024-11-08 18:36:11,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=397, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2024-11-08 18:36:11,892 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2024-11-08 18:36:11,892 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 397 flow [2024-11-08 18:36:11,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 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-08 18:36:11,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:11,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:11,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:36:11,893 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-08 18:36:11,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1252705673, now seen corresponding path program 2 times [2024-11-08 18:36:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:11,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61000225] [2024-11-08 18:36:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:36:12,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:36:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:36:12,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:36:12,233 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:36:12,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-08 18:36:12,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-08 18:36:12,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-08 18:36:12,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-08 18:36:12,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-08 18:36:12,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-08 18:36:12,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-08 18:36:12,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:36:12,242 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:12,348 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 18:36:12,348 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:36:12,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:36:12 BasicIcfg [2024-11-08 18:36:12,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:36:12,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:36:12,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:36:12,354 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:36:12,355 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:35:55" (3/4) ... [2024-11-08 18:36:12,357 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:36:12,358 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:36:12,359 INFO L158 Benchmark]: Toolchain (without parser) took 19308.92ms. Allocated memory was 182.5MB in the beginning and 935.3MB in the end (delta: 752.9MB). Free memory was 144.8MB in the beginning and 318.3MB in the end (delta: -173.5MB). Peak memory consumption was 581.2MB. Max. memory is 16.1GB. [2024-11-08 18:36:12,359 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 182.5MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:36:12,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 932.02ms. Allocated memory is still 182.5MB. Free memory was 144.0MB in the beginning and 118.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 18:36:12,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.57ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 115.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:36:12,360 INFO L158 Benchmark]: Boogie Preprocessor took 77.43ms. Allocated memory is still 182.5MB. Free memory was 115.4MB in the beginning and 112.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:36:12,361 INFO L158 Benchmark]: RCFGBuilder took 1272.78ms. Allocated memory is still 182.5MB. Free memory was 112.0MB in the beginning and 147.6MB in the end (delta: -35.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-08 18:36:12,361 INFO L158 Benchmark]: TraceAbstraction took 16932.07ms. Allocated memory was 182.5MB in the beginning and 935.3MB in the end (delta: 752.9MB). Free memory was 147.6MB in the beginning and 319.3MB in the end (delta: -171.7MB). Peak memory consumption was 583.3MB. Max. memory is 16.1GB. [2024-11-08 18:36:12,362 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 935.3MB. Free memory is still 318.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:36:12,363 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.30ms. Allocated memory is still 182.5MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 932.02ms. Allocated memory is still 182.5MB. Free memory was 144.0MB in the beginning and 118.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.57ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 115.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.43ms. Allocated memory is still 182.5MB. Free memory was 115.4MB in the beginning and 112.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1272.78ms. Allocated memory is still 182.5MB. Free memory was 112.0MB in the beginning and 147.6MB in the end (delta: -35.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16932.07ms. Allocated memory was 182.5MB in the beginning and 935.3MB in the end (delta: 752.9MB). Free memory was 147.6MB in the beginning and 319.3MB in the end (delta: -171.7MB). Peak memory consumption was 583.3MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 935.3MB. Free memory is still 318.3MB. 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; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t873; [L854] FCALL, FORK 0 pthread_create(&t873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t874; [L856] FCALL, FORK 0 pthread_create(&t874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873=-1, t874=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t875; [L858] FCALL, FORK 0 pthread_create(&t875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873=-1, t874=0, t875=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873=-1, t874=0, t875=1, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873=-1, t874=0, t875=1, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873=-1, t874=0, t875=1, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L873] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix033_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] - 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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 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: 16.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 452 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1264 IncrementalHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 35 mSDtfsCounter, 1264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:36:12,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX --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 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:36:14,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:36:14,974 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-08 18:36:14,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:36:14,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:36:15,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:36:15,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:36:15,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:36:15,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:36:15,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:36:15,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:36:15,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:36:15,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:36:15,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:36:15,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:36:15,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:36:15,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:36:15,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:36:15,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:36:15,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:36:15,039 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:36:15,040 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:36:15,040 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:36:15,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:36:15,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:36:15,042 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:36:15,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:36:15,042 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:36:15,043 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:36:15,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:36:15,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:36:15,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:36:15,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:36:15,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:36:15,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:36:15,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:36:15,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:36:15,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:36:15,050 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:36:15,050 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:36:15,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:36:15,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:36:15,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:36:15,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:36:15,067 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX 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 -> 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 [2024-11-08 18:36:15,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:36:15,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:36:15,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:36:15,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:36:15,619 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:36:15,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-08 18:36:17,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:36:18,252 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:36:18,253 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-11-08 18:36:18,279 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/data/53c7eea96/6de6188b9383467f93dd3c4e1bdd2348/FLAG10ff18980 [2024-11-08 18:36:18,439 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/data/53c7eea96/6de6188b9383467f93dd3c4e1bdd2348 [2024-11-08 18:36:18,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:36:18,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:36:18,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:36:18,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:36:18,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:36:18,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:36:18" (1/1) ... [2024-11-08 18:36:18,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1cdfb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:18, skipping insertion in model container [2024-11-08 18:36:18,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:36:18" (1/1) ... [2024-11-08 18:36:18,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:36:19,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:36:19,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:36:19,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:36:19,294 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:36:19,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19 WrapperNode [2024-11-08 18:36:19,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:36:19,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:36:19,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:36:19,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:36:19,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,375 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 124 [2024-11-08 18:36:19,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:36:19,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:36:19,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:36:19,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:36:19,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,426 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-08 18:36:19,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:36:19,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:36:19,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:36:19,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:36:19,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (1/1) ... [2024-11-08 18:36:19,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:36:19,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:19,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:36:19,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:36:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 18:36:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:36:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:36:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-08 18:36:19,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-08 18:36:19,522 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-08 18:36:19,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-08 18:36:19,522 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-08 18:36:19,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-08 18:36:19,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 18:36:19,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:36:19,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:36:19,524 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:36:19,687 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:36:19,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:36:20,192 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:36:20,192 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:36:20,516 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:36:20,516 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:36:20,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:20 BoogieIcfgContainer [2024-11-08 18:36:20,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:36:20,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:36:20,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:36:20,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:36:20,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:36:18" (1/3) ... [2024-11-08 18:36:20,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62707fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:36:20, skipping insertion in model container [2024-11-08 18:36:20,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:19" (2/3) ... [2024-11-08 18:36:20,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62707fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:36:20, skipping insertion in model container [2024-11-08 18:36:20,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:20" (3/3) ... [2024-11-08 18:36:20,530 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-11-08 18:36:20,551 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:36:20,551 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-08 18:36:20,551 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:36:20,651 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 18:36:20,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2024-11-08 18:36:20,743 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2024-11-08 18:36:20,744 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:36:20,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-11-08 18:36:20,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2024-11-08 18:36:20,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2024-11-08 18:36:20,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:36:20,777 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;@97980d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:36:20,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 18:36:20,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:36:20,784 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-08 18:36:20,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:36:20,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:20,785 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-08 18:36:20,786 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-08 18:36:20,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash 12556062, now seen corresponding path program 1 times [2024-11-08 18:36:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:20,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119811411] [2024-11-08 18:36:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:20,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:20,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:20,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:20,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:36:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:20,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:36:20,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:20,985 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-08 18:36:20,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:20,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:20,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119811411] [2024-11-08 18:36:20,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119811411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:20,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:20,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:36:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944468520] [2024-11-08 18:36:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:20,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:36:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:21,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:36:21,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:36:21,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-11-08 18:36:21,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-08 18:36:21,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:21,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-11-08 18:36:21,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:21,617 INFO L124 PetriNetUnfolderBase]: 825/1461 cut-off events. [2024-11-08 18:36:21,618 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-08 18:36:21,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1461 events. 825/1461 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8995 event pairs, 457 based on Foata normal form. 96/1530 useless extension candidates. Maximal degree in co-relation 2731. Up to 1009 conditions per place. [2024-11-08 18:36:21,637 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 33 selfloop transitions, 2 changer transitions 2/57 dead transitions. [2024-11-08 18:36:21,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 203 flow [2024-11-08 18:36:21,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:36:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:36:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-08 18:36:21,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-11-08 18:36:21,653 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 111 transitions. [2024-11-08 18:36:21,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 203 flow [2024-11-08 18:36:21,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 18:36:21,663 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2024-11-08 18:36:21,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-08 18:36:21,672 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-11-08 18:36:21,673 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2024-11-08 18:36:21,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-08 18:36:21,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:21,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:21,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:36:21,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:21,875 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-08 18:36:21,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1384281177, now seen corresponding path program 1 times [2024-11-08 18:36:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:21,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153509761] [2024-11-08 18:36:21,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:21,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:21,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:21,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:36:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:21,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:36:21,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:22,023 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-08 18:36:22,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:22,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:22,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153509761] [2024-11-08 18:36:22,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153509761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:22,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:22,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:36:22,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833689585] [2024-11-08 18:36:22,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:22,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:36:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:36:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:36:22,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-11-08 18:36:22,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-08 18:36:22,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:22,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-11-08 18:36:22,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:22,380 INFO L124 PetriNetUnfolderBase]: 721/1405 cut-off events. [2024-11-08 18:36:22,381 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-08 18:36:22,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 1405 events. 721/1405 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9456 event pairs, 721 based on Foata normal form. 48/1371 useless extension candidates. Maximal degree in co-relation 2615. Up to 1090 conditions per place. [2024-11-08 18:36:22,392 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 18 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-08 18:36:22,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 128 flow [2024-11-08 18:36:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:36:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:36:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-08 18:36:22,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-11-08 18:36:22,396 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 87 transitions. [2024-11-08 18:36:22,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 128 flow [2024-11-08 18:36:22,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:36:22,398 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2024-11-08 18:36:22,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-08 18:36:22,400 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-11-08 18:36:22,400 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2024-11-08 18:36:22,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-08 18:36:22,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:22,401 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:22,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:36:22,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:22,602 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-08 18:36:22,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:22,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1384279690, now seen corresponding path program 1 times [2024-11-08 18:36:22,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:22,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177697129] [2024-11-08 18:36:22,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:22,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:22,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:22,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:22,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:36:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:22,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:36:22,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:22,778 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-08 18:36:22,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:22,778 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:22,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177697129] [2024-11-08 18:36:22,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177697129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:22,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:22,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:36:22,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238649338] [2024-11-08 18:36:22,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:22,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:36:22,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:36:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:36:22,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-08 18:36:22,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-08 18:36:22,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:22,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-08 18:36:22,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:23,368 INFO L124 PetriNetUnfolderBase]: 1499/2629 cut-off events. [2024-11-08 18:36:23,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:36:23,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4945 conditions, 2629 events. 1499/2629 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17128 event pairs, 188 based on Foata normal form. 100/2650 useless extension candidates. Maximal degree in co-relation 4939. Up to 1316 conditions per place. [2024-11-08 18:36:23,384 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 42 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2024-11-08 18:36:23,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 234 flow [2024-11-08 18:36:23,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:36:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 18:36:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-11-08 18:36:23,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-08 18:36:23,387 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 4 states and 126 transitions. [2024-11-08 18:36:23,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 234 flow [2024-11-08 18:36:23,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:36:23,389 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 117 flow [2024-11-08 18:36:23,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-11-08 18:36:23,390 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-11-08 18:36:23,391 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 117 flow [2024-11-08 18:36:23,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-08 18:36:23,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:23,391 INFO L204 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-08 18:36:23,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:23,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:23,592 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-08 18:36:23,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1663600163, now seen corresponding path program 1 times [2024-11-08 18:36:23,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:23,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1050552596] [2024-11-08 18:36:23,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:23,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:23,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:23,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:23,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:36:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:23,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:36:23,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:23,785 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-08 18:36:23,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:23,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:23,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050552596] [2024-11-08 18:36:23,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050552596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:23,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:23,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:36:23,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858311094] [2024-11-08 18:36:23,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:23,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:36:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:23,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:36:23,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:36:23,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-08 18:36:23,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-08 18:36:23,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:23,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-08 18:36:23,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:24,261 INFO L124 PetriNetUnfolderBase]: 962/1696 cut-off events. [2024-11-08 18:36:24,262 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-11-08 18:36:24,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1696 events. 962/1696 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9566 event pairs, 100 based on Foata normal form. 82/1721 useless extension candidates. Maximal degree in co-relation 3793. Up to 581 conditions per place. [2024-11-08 18:36:24,274 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 53 selfloop transitions, 8 changer transitions 1/77 dead transitions. [2024-11-08 18:36:24,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 334 flow [2024-11-08 18:36:24,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:36:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:36:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-11-08 18:36:24,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6625 [2024-11-08 18:36:24,279 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 117 flow. Second operand 5 states and 159 transitions. [2024-11-08 18:36:24,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 334 flow [2024-11-08 18:36:24,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 324 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-08 18:36:24,284 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 157 flow [2024-11-08 18:36:24,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2024-11-08 18:36:24,286 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-11-08 18:36:24,287 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 157 flow [2024-11-08 18:36:24,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-08 18:36:24,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:24,287 INFO L204 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-08 18:36:24,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:36:24,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:24,489 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-08 18:36:24,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 6447960, now seen corresponding path program 1 times [2024-11-08 18:36:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823731605] [2024-11-08 18:36:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:24,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:24,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:24,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:24,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:36:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:24,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:36:24,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:24,708 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-08 18:36:24,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:24,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823731605] [2024-11-08 18:36:24,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823731605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:24,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:24,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:36:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129167340] [2024-11-08 18:36:24,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:24,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:36:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:36:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:36:24,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-08 18:36:24,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-08 18:36:24,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:24,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-08 18:36:24,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:25,136 INFO L124 PetriNetUnfolderBase]: 569/973 cut-off events. [2024-11-08 18:36:25,136 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-11-08 18:36:25,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2488 conditions, 973 events. 569/973 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4500 event pairs, 83 based on Foata normal form. 40/967 useless extension candidates. Maximal degree in co-relation 2477. Up to 308 conditions per place. [2024-11-08 18:36:25,143 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 46 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2024-11-08 18:36:25,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 341 flow [2024-11-08 18:36:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:36:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:36:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-11-08 18:36:25,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-11-08 18:36:25,145 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 157 flow. Second operand 6 states and 174 transitions. [2024-11-08 18:36:25,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 341 flow [2024-11-08 18:36:25,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 316 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-08 18:36:25,152 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 171 flow [2024-11-08 18:36:25,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-11-08 18:36:25,153 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-11-08 18:36:25,153 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 171 flow [2024-11-08 18:36:25,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-08 18:36:25,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:25,154 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:25,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:36:25,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:25,359 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-08 18:36:25,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash -494109489, now seen corresponding path program 1 times [2024-11-08 18:36:25,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:25,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109863711] [2024-11-08 18:36:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:25,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:25,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:25,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:25,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:36:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:25,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 18:36:25,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:26,192 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-08 18:36:26,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:26,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109863711] [2024-11-08 18:36:26,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109863711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:26,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:26,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:36:26,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339138205] [2024-11-08 18:36:26,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:26,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:36:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:26,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:36:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:36:26,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-08 18:36:26,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 171 flow. Second operand has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 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-08 18:36:26,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:26,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-08 18:36:26,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:26,969 INFO L124 PetriNetUnfolderBase]: 468/905 cut-off events. [2024-11-08 18:36:26,970 INFO L125 PetriNetUnfolderBase]: For 510/534 co-relation queries the response was YES. [2024-11-08 18:36:26,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 905 events. 468/905 cut-off events. For 510/534 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4413 event pairs, 124 based on Foata normal form. 8/880 useless extension candidates. Maximal degree in co-relation 2178. Up to 249 conditions per place. [2024-11-08 18:36:26,979 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 33 selfloop transitions, 4 changer transitions 28/88 dead transitions. [2024-11-08 18:36:26,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 88 transitions, 409 flow [2024-11-08 18:36:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:36:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 18:36:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 276 transitions. [2024-11-08 18:36:26,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-11-08 18:36:26,982 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 171 flow. Second operand 10 states and 276 transitions. [2024-11-08 18:36:26,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 88 transitions, 409 flow [2024-11-08 18:36:26,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 342 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-08 18:36:26,998 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 135 flow [2024-11-08 18:36:26,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=135, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2024-11-08 18:36:27,002 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-11-08 18:36:27,003 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 135 flow [2024-11-08 18:36:27,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 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-08 18:36:27,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:27,004 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:27,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:27,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:27,205 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-08 18:36:27,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:27,206 INFO L85 PathProgramCache]: Analyzing trace with hash -659586381, now seen corresponding path program 2 times [2024-11-08 18:36:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877483703] [2024-11-08 18:36:27,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:36:27,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:27,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:27,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:36:27,359 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 18:36:27,359 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:36:27,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 18:36:27,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:36:27,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:27,498 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:27,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877483703] [2024-11-08 18:36:27,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877483703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:36:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88335806] [2024-11-08 18:36:27,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:27,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:36:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:27,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:36:27,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:36:27,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-08 18:36:27,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-08 18:36:27,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:27,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-08 18:36:27,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:28,010 INFO L124 PetriNetUnfolderBase]: 717/1391 cut-off events. [2024-11-08 18:36:28,010 INFO L125 PetriNetUnfolderBase]: For 262/273 co-relation queries the response was YES. [2024-11-08 18:36:28,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 1391 events. 717/1391 cut-off events. For 262/273 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8018 event pairs, 305 based on Foata normal form. 8/1317 useless extension candidates. Maximal degree in co-relation 2966. Up to 625 conditions per place. [2024-11-08 18:36:28,021 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 31 selfloop transitions, 2 changer transitions 17/71 dead transitions. [2024-11-08 18:36:28,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 308 flow [2024-11-08 18:36:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:36:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:36:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-11-08 18:36:28,023 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2024-11-08 18:36:28,024 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 135 flow. Second operand 6 states and 165 transitions. [2024-11-08 18:36:28,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 308 flow [2024-11-08 18:36:28,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 282 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-08 18:36:28,033 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 133 flow [2024-11-08 18:36:28,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2024-11-08 18:36:28,034 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-11-08 18:36:28,035 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 133 flow [2024-11-08 18:36:28,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-08 18:36:28,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:28,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:28,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 18:36:28,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:28,244 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-08 18:36:28,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1694226345, now seen corresponding path program 3 times [2024-11-08 18:36:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:28,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240739232] [2024-11-08 18:36:28,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:36:28,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:28,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:28,252 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:28,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:36:28,402 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-08 18:36:28,402 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:36:28,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 18:36:28,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:28,657 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-08 18:36:28,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:28,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:28,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240739232] [2024-11-08 18:36:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240739232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:28,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:36:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226222846] [2024-11-08 18:36:28,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:28,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:36:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:28,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:36:28,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:36:28,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-08 18:36:28,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 133 flow. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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-08 18:36:28,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:36:28,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-08 18:36:28,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:36:29,424 INFO L124 PetriNetUnfolderBase]: 907/1560 cut-off events. [2024-11-08 18:36:29,424 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2024-11-08 18:36:29,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 1560 events. 907/1560 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7313 event pairs, 222 based on Foata normal form. 8/1550 useless extension candidates. Maximal degree in co-relation 3451. Up to 767 conditions per place. [2024-11-08 18:36:29,437 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 40 selfloop transitions, 6 changer transitions 41/99 dead transitions. [2024-11-08 18:36:29,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 461 flow [2024-11-08 18:36:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:36:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 18:36:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-11-08 18:36:29,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2024-11-08 18:36:29,440 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 133 flow. Second operand 9 states and 226 transitions. [2024-11-08 18:36:29,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 461 flow [2024-11-08 18:36:29,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 443 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-08 18:36:29,444 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 158 flow [2024-11-08 18:36:29,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=158, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2024-11-08 18:36:29,446 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2024-11-08 18:36:29,446 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 158 flow [2024-11-08 18:36:29,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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-08 18:36:29,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:36:29,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:29,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:29,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:29,652 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-08 18:36:29,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash 338994803, now seen corresponding path program 4 times [2024-11-08 18:36:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632288612] [2024-11-08 18:36:29,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 18:36:29,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:29,659 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:29,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:36:29,795 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 18:36:29,796 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-08 18:36:29,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:36:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:36:29,922 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-08 18:36:29,923 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:36:29,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-08 18:36:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-08 18:36:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-08 18:36:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-08 18:36:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-08 18:36:29,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-08 18:36:29,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-08 18:36:29,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:30,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:30,130 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-08 18:36:30,273 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 18:36:30,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:36:30,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:36:30 BasicIcfg [2024-11-08 18:36:30,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:36:30,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:36:30,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:36:30,283 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:36:30,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:20" (3/4) ... [2024-11-08 18:36:30,286 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:36:30,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:36:30,288 INFO L158 Benchmark]: Toolchain (without parser) took 11844.64ms. Allocated memory was 79.7MB in the beginning and 182.5MB in the end (delta: 102.8MB). Free memory was 53.6MB in the beginning and 122.6MB in the end (delta: -69.0MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-11-08 18:36:30,289 INFO L158 Benchmark]: CDTParser took 2.59ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:36:30,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 850.38ms. Allocated memory is still 79.7MB. Free memory was 53.4MB in the beginning and 49.8MB in the end (delta: 3.6MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-08 18:36:30,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.60ms. Allocated memory is still 79.7MB. Free memory was 49.8MB in the beginning and 47.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:36:30,291 INFO L158 Benchmark]: Boogie Preprocessor took 77.92ms. Allocated memory is still 79.7MB. Free memory was 47.4MB in the beginning and 44.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:36:30,291 INFO L158 Benchmark]: RCFGBuilder took 1059.25ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 43.6MB in the beginning and 44.1MB in the end (delta: -464.9kB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-08 18:36:30,292 INFO L158 Benchmark]: TraceAbstraction took 9761.68ms. Allocated memory was 96.5MB in the beginning and 182.5MB in the end (delta: 86.0MB). Free memory was 43.5MB in the beginning and 122.6MB in the end (delta: -79.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-08 18:36:30,293 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 182.5MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:36:30,296 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.59ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 850.38ms. Allocated memory is still 79.7MB. Free memory was 53.4MB in the beginning and 49.8MB in the end (delta: 3.6MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.60ms. Allocated memory is still 79.7MB. Free memory was 49.8MB in the beginning and 47.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.92ms. Allocated memory is still 79.7MB. Free memory was 47.4MB in the beginning and 44.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1059.25ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 43.6MB in the beginning and 44.1MB in the end (delta: -464.9kB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9761.68ms. Allocated memory was 96.5MB in the beginning and 182.5MB in the end (delta: 86.0MB). Free memory was 43.5MB in the beginning and 122.6MB in the end (delta: -79.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 182.5MB. Free memory is still 122.6MB. 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; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t873; [L854] FCALL, FORK 0 pthread_create(&t873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t874; [L856] FCALL, FORK 0 pthread_create(&t874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873=-2, t874=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L857] 0 pthread_t t875; [L858] FCALL, FORK 0 pthread_create(&t875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873=-2, t874=-1, t875=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873=-2, t874=-1, t875=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873=-2, t874=-1, t875=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873=-2, t874=-1, t875=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L873] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix033_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] - 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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 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.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1151 IncrementalHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 13 mSDtfsCounter, 1151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=5, InterpolantAutomatonStates: 46, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 773 SizeOfPredicates, 22 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:36:30,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86b1cdd-6bcb-4207-80c9-7bcea75f5428/bin/uautomizer-verify-jihMAELWvX/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