./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd --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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:59:06,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:59:06,432 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 12:59:06,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:59:06,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:59:06,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:59:06,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:59:06,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:59:06,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:59:06,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:59:06,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:59:06,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:59:06,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:59:06,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:59:06,480 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:59:06,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:59:06,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:59:06,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:59:06,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:59:06,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:59:06,481 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 12:59:06,481 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 12:59:06,481 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 12:59:06,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:59:06,483 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:59:06,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:59:06,483 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:59:06,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:59:06,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:59:06,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:59:06,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:59:06,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:59:06,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:59:06,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:59:06,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:59:06,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:59:06,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:59:06,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:59:06,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:59:06,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:59:06,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:59:06,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:59:06,485 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2024-11-13 12:59:06,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:59:06,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:59:06,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:59:06,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:59:06,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:59:06,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-13 12:59:08,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:59:09,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:59:09,002 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-13 12:59:09,027 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/data/d99bd6108/15683040e8d1413292dcf5e5a8282146/FLAGfe43cece8 [2024-11-13 12:59:09,044 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/data/d99bd6108/15683040e8d1413292dcf5e5a8282146 [2024-11-13 12:59:09,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:59:09,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:59:09,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:59:09,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:59:09,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:59:09,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc2a0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09, skipping insertion in model container [2024-11-13 12:59:09,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:59:09,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:59:09,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:59:09,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:59:09,648 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:59:09,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09 WrapperNode [2024-11-13 12:59:09,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:59:09,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:59:09,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:59:09,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:59:09,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,699 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2024-11-13 12:59:09,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:59:09,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:59:09,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:59:09,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:59:09,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,748 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-13 12:59:09,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:59:09,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:59:09,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:59:09,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:59:09,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (1/1) ... [2024-11-13 12:59:09,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:59:09,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:09,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:59:09,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:59:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 12:59:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:59:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 12:59:09,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 12:59:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 12:59:09,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 12:59:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 12:59:09,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 12:59:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 12:59:09,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 12:59:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:59:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 12:59:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:59:09,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:59:09,877 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 12:59:10,093 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:59:10,095 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:59:10,664 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:59:10,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:59:10,985 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:59:10,986 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 12:59:10,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:59:10 BoogieIcfgContainer [2024-11-13 12:59:10,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:59:10,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:59:10,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:59:10,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:59:10,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:59:09" (1/3) ... [2024-11-13 12:59:11,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3888d525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:59:10, skipping insertion in model container [2024-11-13 12:59:11,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:09" (2/3) ... [2024-11-13 12:59:11,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3888d525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:59:11, skipping insertion in model container [2024-11-13 12:59:11,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:59:10" (3/3) ... [2024-11-13 12:59:11,002 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-13 12:59:11,022 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:59:11,024 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 12:59:11,024 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:59:11,135 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 12:59:11,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-13 12:59:11,235 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-13 12:59:11,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:59:11,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-13 12:59:11,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-13 12:59:11,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-13 12:59:11,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:59:11,284 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;@3af4c815, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:59:11,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 12:59:11,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 12:59:11,294 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 12:59:11,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:59:11,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:11,297 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 12:59:11,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:11,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash 12738587, now seen corresponding path program 1 times [2024-11-13 12:59:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:11,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75062620] [2024-11-13 12:59:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:11,968 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-13 12:59:11,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:11,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75062620] [2024-11-13 12:59:11,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75062620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:11,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:11,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:59:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923371329] [2024-11-13 12:59:11,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:11,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:12,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:12,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-13 12:59:12,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-13 12:59:12,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:12,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-13 12:59:12,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:13,859 INFO L124 PetriNetUnfolderBase]: 3311/5456 cut-off events. [2024-11-13 12:59:13,860 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-13 12:59:13,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10136 conditions, 5456 events. 3311/5456 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 39587 event pairs, 593 based on Foata normal form. 288/5705 useless extension candidates. Maximal degree in co-relation 10124. Up to 3661 conditions per place. [2024-11-13 12:59:13,917 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 41 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2024-11-13 12:59:13,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 241 flow [2024-11-13 12:59:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:59:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-11-13 12:59:13,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2024-11-13 12:59:13,935 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 122 transitions. [2024-11-13 12:59:13,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 241 flow [2024-11-13 12:59:13,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-13 12:59:13,950 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-13 12:59:13,953 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-13 12:59:13,960 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-13 12:59:13,961 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-13 12:59:13,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-13 12:59:13,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:13,962 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:13,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:59:13,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:13,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:13,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1313777391, now seen corresponding path program 1 times [2024-11-13 12:59:13,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:13,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007537335] [2024-11-13 12:59:13,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:13,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007537335] [2024-11-13 12:59:14,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007537335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:14,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:14,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:59:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872509034] [2024-11-13 12:59:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:14,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:14,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:14,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:14,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:14,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-13 12:59:14,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-13 12:59:14,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:14,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-13 12:59:14,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:15,123 INFO L124 PetriNetUnfolderBase]: 2903/4911 cut-off events. [2024-11-13 12:59:15,124 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-13 12:59:15,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9315 conditions, 4911 events. 2903/4911 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34953 event pairs, 2903 based on Foata normal form. 144/4916 useless extension candidates. Maximal degree in co-relation 9305. Up to 4016 conditions per place. [2024-11-13 12:59:15,161 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 22 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-13 12:59:15,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 146 flow [2024-11-13 12:59:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:59:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-13 12:59:15,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5911949685534591 [2024-11-13 12:59:15,163 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 94 transitions. [2024-11-13 12:59:15,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 146 flow [2024-11-13 12:59:15,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 12:59:15,165 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2024-11-13 12:59:15,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-13 12:59:15,168 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2024-11-13 12:59:15,168 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2024-11-13 12:59:15,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-13 12:59:15,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:15,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:15,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:59:15,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:15,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1313776076, now seen corresponding path program 1 times [2024-11-13 12:59:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:15,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190911995] [2024-11-13 12:59:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:15,523 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-13 12:59:15,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190911995] [2024-11-13 12:59:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190911995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:59:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139421674] [2024-11-13 12:59:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:15,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:15,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:15,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:15,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:15,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:15,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:15,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:15,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:17,559 INFO L124 PetriNetUnfolderBase]: 8875/13615 cut-off events. [2024-11-13 12:59:17,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:59:17,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25937 conditions, 13615 events. 8875/13615 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 95754 event pairs, 1033 based on Foata normal form. 400/13929 useless extension candidates. Maximal degree in co-relation 25931. Up to 7301 conditions per place. [2024-11-13 12:59:17,649 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 53 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-11-13 12:59:17,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 284 flow [2024-11-13 12:59:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:59:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 12:59:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-11-13 12:59:17,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2024-11-13 12:59:17,651 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 4 states and 138 transitions. [2024-11-13 12:59:17,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 284 flow [2024-11-13 12:59:17,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 12:59:17,653 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 135 flow [2024-11-13 12:59:17,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-11-13 12:59:17,654 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2024-11-13 12:59:17,654 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 135 flow [2024-11-13 12:59:17,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:17,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:17,655 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] [2024-11-13 12:59:17,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:59:17,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 218433637, now seen corresponding path program 1 times [2024-11-13 12:59:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486035472] [2024-11-13 12:59:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486035472] [2024-11-13 12:59:18,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486035472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:18,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:18,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:59:18,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897949650] [2024-11-13 12:59:18,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:18,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:59:18,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:18,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:59:18,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:59:18,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:18,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:18,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:18,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:18,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:20,016 INFO L124 PetriNetUnfolderBase]: 6751/10375 cut-off events. [2024-11-13 12:59:20,016 INFO L125 PetriNetUnfolderBase]: For 2392/2392 co-relation queries the response was YES. [2024-11-13 12:59:20,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23232 conditions, 10375 events. 6751/10375 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 68996 event pairs, 451 based on Foata normal form. 364/10657 useless extension candidates. Maximal degree in co-relation 23223. Up to 4601 conditions per place. [2024-11-13 12:59:20,075 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 68 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-11-13 12:59:20,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 416 flow [2024-11-13 12:59:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:59:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 12:59:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-11-13 12:59:20,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6641509433962264 [2024-11-13 12:59:20,081 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 135 flow. Second operand 5 states and 176 transitions. [2024-11-13 12:59:20,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 416 flow [2024-11-13 12:59:20,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 405 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 12:59:20,089 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 187 flow [2024-11-13 12:59:20,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-13 12:59:20,091 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2024-11-13 12:59:20,092 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 187 flow [2024-11-13 12:59:20,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:20,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:20,092 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-13 12:59:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:59:20,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:20,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash 405272437, now seen corresponding path program 1 times [2024-11-13 12:59:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500664940] [2024-11-13 12:59:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:20,519 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-13 12:59:20,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500664940] [2024-11-13 12:59:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500664940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:59:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292709301] [2024-11-13 12:59:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:20,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:59:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:20,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:59:20,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:59:20,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:20,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:20,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:20,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:20,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:21,414 INFO L124 PetriNetUnfolderBase]: 4259/6431 cut-off events. [2024-11-13 12:59:21,414 INFO L125 PetriNetUnfolderBase]: For 4590/4590 co-relation queries the response was YES. [2024-11-13 12:59:21,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16274 conditions, 6431 events. 4259/6431 cut-off events. For 4590/4590 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 37171 event pairs, 289 based on Foata normal form. 244/6593 useless extension candidates. Maximal degree in co-relation 16263. Up to 1788 conditions per place. [2024-11-13 12:59:21,437 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 81 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2024-11-13 12:59:21,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 547 flow [2024-11-13 12:59:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:59:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 12:59:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-11-13 12:59:21,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-13 12:59:21,439 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 187 flow. Second operand 6 states and 212 transitions. [2024-11-13 12:59:21,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 547 flow [2024-11-13 12:59:21,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 110 transitions, 517 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-13 12:59:21,463 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 237 flow [2024-11-13 12:59:21,464 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-13 12:59:21,464 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-11-13 12:59:21,464 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 237 flow [2024-11-13 12:59:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:21,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:21,465 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] [2024-11-13 12:59:21,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:59:21,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:21,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:21,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1372171217, now seen corresponding path program 1 times [2024-11-13 12:59:21,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:21,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60247126] [2024-11-13 12:59:21,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:21,845 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-13 12:59:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60247126] [2024-11-13 12:59:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60247126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:21,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:59:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091644792] [2024-11-13 12:59:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:59:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:21,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:59:21,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:21,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:21,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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-13 12:59:21,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:21,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:21,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:22,580 INFO L124 PetriNetUnfolderBase]: 2895/4199 cut-off events. [2024-11-13 12:59:22,580 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2024-11-13 12:59:22,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11675 conditions, 4199 events. 2895/4199 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 21807 event pairs, 231 based on Foata normal form. 96/4213 useless extension candidates. Maximal degree in co-relation 11663. Up to 1316 conditions per place. [2024-11-13 12:59:22,604 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 72 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-11-13 12:59:22,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 105 transitions, 537 flow [2024-11-13 12:59:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:59:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 12:59:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-11-13 12:59:22,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091644204851752 [2024-11-13 12:59:22,606 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 237 flow. Second operand 7 states and 226 transitions. [2024-11-13 12:59:22,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 105 transitions, 537 flow [2024-11-13 12:59:22,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 491 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-13 12:59:22,639 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 247 flow [2024-11-13 12:59:22,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-11-13 12:59:22,639 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2024-11-13 12:59:22,639 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 247 flow [2024-11-13 12:59:22,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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-13 12:59:22,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:22,640 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, 1, 1, 1] [2024-11-13 12:59:22,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:59:22,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:22,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1991607593, now seen corresponding path program 1 times [2024-11-13 12:59:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:22,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091740117] [2024-11-13 12:59:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:25,253 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-13 12:59:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091740117] [2024-11-13 12:59:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091740117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:25,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:25,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 12:59:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482934079] [2024-11-13 12:59:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:25,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:59:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:59:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:59:25,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-13 12:59:25,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 247 flow. Second operand has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:25,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:25,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-13 12:59:25,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:26,283 INFO L124 PetriNetUnfolderBase]: 3038/5001 cut-off events. [2024-11-13 12:59:26,284 INFO L125 PetriNetUnfolderBase]: For 3179/3369 co-relation queries the response was YES. [2024-11-13 12:59:26,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12260 conditions, 5001 events. 3038/5001 cut-off events. For 3179/3369 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 32729 event pairs, 1145 based on Foata normal form. 16/4683 useless extension candidates. Maximal degree in co-relation 12247. Up to 1490 conditions per place. [2024-11-13 12:59:26,320 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 62 selfloop transitions, 5 changer transitions 12/109 dead transitions. [2024-11-13 12:59:26,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 547 flow [2024-11-13 12:59:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:59:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 12:59:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2024-11-13 12:59:26,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6226415094339622 [2024-11-13 12:59:26,323 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 247 flow. Second operand 8 states and 264 transitions. [2024-11-13 12:59:26,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 547 flow [2024-11-13 12:59:26,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 109 transitions, 431 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-11-13 12:59:26,355 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 185 flow [2024-11-13 12:59:26,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=185, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-11-13 12:59:26,355 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2024-11-13 12:59:26,356 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 185 flow [2024-11-13 12:59:26,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:26,356 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:26,356 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, 1, 1, 1] [2024-11-13 12:59:26,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:59:26,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:26,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash 230169297, now seen corresponding path program 2 times [2024-11-13 12:59:26,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:26,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908506058] [2024-11-13 12:59:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:26,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:26,816 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-13 12:59:26,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908506058] [2024-11-13 12:59:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908506058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:26,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:26,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:59:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189731986] [2024-11-13 12:59:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:26,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:59:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:26,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:59:26,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:59:26,828 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:26,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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-13 12:59:26,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:26,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:26,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:28,333 INFO L124 PetriNetUnfolderBase]: 9479/15084 cut-off events. [2024-11-13 12:59:28,333 INFO L125 PetriNetUnfolderBase]: For 2599/2605 co-relation queries the response was YES. [2024-11-13 12:59:28,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33190 conditions, 15084 events. 9479/15084 cut-off events. For 2599/2605 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 108944 event pairs, 3483 based on Foata normal form. 34/14509 useless extension candidates. Maximal degree in co-relation 33177. Up to 6503 conditions per place. [2024-11-13 12:59:28,389 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 49 selfloop transitions, 7 changer transitions 19/101 dead transitions. [2024-11-13 12:59:28,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 459 flow [2024-11-13 12:59:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:59:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 12:59:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-11-13 12:59:28,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5786163522012578 [2024-11-13 12:59:28,391 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 185 flow. Second operand 6 states and 184 transitions. [2024-11-13 12:59:28,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 459 flow [2024-11-13 12:59:28,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 447 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-13 12:59:28,400 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 217 flow [2024-11-13 12:59:28,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2024-11-13 12:59:28,404 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2024-11-13 12:59:28,404 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 217 flow [2024-11-13 12:59:28,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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-13 12:59:28,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:28,405 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, 1, 1, 1] [2024-11-13 12:59:28,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:59:28,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:28,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:28,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1475792801, now seen corresponding path program 3 times [2024-11-13 12:59:28,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:28,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292938966] [2024-11-13 12:59:28,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:28,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:28,812 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-13 12:59:28,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292938966] [2024-11-13 12:59:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292938966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:59:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894408526] [2024-11-13 12:59:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:28,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:59:28,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:59:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:59:28,828 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2024-11-13 12:59:28,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:28,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:28,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2024-11-13 12:59:28,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:31,390 INFO L124 PetriNetUnfolderBase]: 14771/23144 cut-off events. [2024-11-13 12:59:31,390 INFO L125 PetriNetUnfolderBase]: For 7192/7200 co-relation queries the response was YES. [2024-11-13 12:59:31,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53586 conditions, 23144 events. 14771/23144 cut-off events. For 7192/7200 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 172379 event pairs, 2777 based on Foata normal form. 36/22083 useless extension candidates. Maximal degree in co-relation 53571. Up to 8228 conditions per place. [2024-11-13 12:59:31,523 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 64 selfloop transitions, 16 changer transitions 22/127 dead transitions. [2024-11-13 12:59:31,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 127 transitions, 638 flow [2024-11-13 12:59:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:59:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 12:59:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2024-11-13 12:59:31,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-13 12:59:31,524 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 217 flow. Second operand 7 states and 212 transitions. [2024-11-13 12:59:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 127 transitions, 638 flow [2024-11-13 12:59:31,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 127 transitions, 626 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-13 12:59:31,537 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 344 flow [2024-11-13 12:59:31,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2024-11-13 12:59:31,540 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2024-11-13 12:59:31,540 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 344 flow [2024-11-13 12:59:31,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:31,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:31,541 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, 1, 1, 1] [2024-11-13 12:59:31,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:59:31,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:31,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2083552739, now seen corresponding path program 4 times [2024-11-13 12:59:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:31,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040511272] [2024-11-13 12:59:31,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:31,931 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-13 12:59:31,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:31,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040511272] [2024-11-13 12:59:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040511272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:59:31,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215829798] [2024-11-13 12:59:31,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:31,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:59:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:31,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:59:31,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:31,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2024-11-13 12:59:31,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 344 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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-13 12:59:31,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:31,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2024-11-13 12:59:31,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:36,550 INFO L124 PetriNetUnfolderBase]: 27864/43891 cut-off events. [2024-11-13 12:59:36,550 INFO L125 PetriNetUnfolderBase]: For 35678/35943 co-relation queries the response was YES. [2024-11-13 12:59:36,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111732 conditions, 43891 events. 27864/43891 cut-off events. For 35678/35943 co-relation queries the response was YES. Maximal size of possible extension queue 2686. Compared 364778 event pairs, 5859 based on Foata normal form. 136/41798 useless extension candidates. Maximal degree in co-relation 111713. Up to 14865 conditions per place. [2024-11-13 12:59:36,712 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 49 selfloop transitions, 7 changer transitions 86/168 dead transitions. [2024-11-13 12:59:36,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 168 transitions, 1039 flow [2024-11-13 12:59:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:59:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 12:59:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 251 transitions. [2024-11-13 12:59:36,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5919811320754716 [2024-11-13 12:59:36,714 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 344 flow. Second operand 8 states and 251 transitions. [2024-11-13 12:59:36,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 168 transitions, 1039 flow [2024-11-13 12:59:36,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 168 transitions, 1033 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-13 12:59:36,768 INFO L231 Difference]: Finished difference. Result has 86 places, 64 transitions, 311 flow [2024-11-13 12:59:36,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=311, PETRI_PLACES=86, PETRI_TRANSITIONS=64} [2024-11-13 12:59:36,769 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 26 predicate places. [2024-11-13 12:59:36,769 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 64 transitions, 311 flow [2024-11-13 12:59:36,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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-13 12:59:36,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:36,769 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, 1, 1, 1] [2024-11-13 12:59:36,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:59:36,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:36,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1571809407, now seen corresponding path program 5 times [2024-11-13 12:59:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:36,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245515879] [2024-11-13 12:59:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:38,316 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-13 12:59:38,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:38,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245515879] [2024-11-13 12:59:38,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245515879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:38,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:38,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 12:59:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171673057] [2024-11-13 12:59:38,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:38,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:59:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:59:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:59:38,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:38,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 64 transitions, 311 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-13 12:59:38,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:38,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:38,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:40,036 INFO L124 PetriNetUnfolderBase]: 4935/8298 cut-off events. [2024-11-13 12:59:40,036 INFO L125 PetriNetUnfolderBase]: For 5659/5689 co-relation queries the response was YES. [2024-11-13 12:59:40,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19907 conditions, 8298 events. 4935/8298 cut-off events. For 5659/5689 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 58088 event pairs, 1208 based on Foata normal form. 24/7881 useless extension candidates. Maximal degree in co-relation 19882. Up to 2729 conditions per place. [2024-11-13 12:59:40,114 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 65 selfloop transitions, 11 changer transitions 41/144 dead transitions. [2024-11-13 12:59:40,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 837 flow [2024-11-13 12:59:40,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:59:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 12:59:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 299 transitions. [2024-11-13 12:59:40,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5641509433962264 [2024-11-13 12:59:40,116 INFO L175 Difference]: Start difference. First operand has 86 places, 64 transitions, 311 flow. Second operand 10 states and 299 transitions. [2024-11-13 12:59:40,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 837 flow [2024-11-13 12:59:40,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 144 transitions, 805 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-13 12:59:40,133 INFO L231 Difference]: Finished difference. Result has 91 places, 64 transitions, 330 flow [2024-11-13 12:59:40,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=330, PETRI_PLACES=91, PETRI_TRANSITIONS=64} [2024-11-13 12:59:40,134 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 31 predicate places. [2024-11-13 12:59:40,134 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 64 transitions, 330 flow [2024-11-13 12:59:40,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-13 12:59:40,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:40,136 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, 1, 1, 1] [2024-11-13 12:59:40,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:59:40,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:40,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1682840147, now seen corresponding path program 6 times [2024-11-13 12:59:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:40,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006292484] [2024-11-13 12:59:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:59:40,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:59:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:59:40,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:59:40,452 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:59:40,453 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-13 12:59:40,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-13 12:59:40,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-13 12:59:40,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-13 12:59:40,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-13 12:59:40,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-13 12:59:40,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-13 12:59:40,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-13 12:59:40,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 12:59:40,456 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:40,588 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 12:59:40,591 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:59:40,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:59:40 BasicIcfg [2024-11-13 12:59:40,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:59:40,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:59:40,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:59:40,601 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:59:40,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:59:10" (3/4) ... [2024-11-13 12:59:40,603 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 12:59:40,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:59:40,606 INFO L158 Benchmark]: Toolchain (without parser) took 31554.52ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 117.6MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 484.3MB. Max. memory is 16.1GB. [2024-11-13 12:59:40,607 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:59:40,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.30ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 93.8MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 12:59:40,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.13ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:59:40,608 INFO L158 Benchmark]: Boogie Preprocessor took 94.51ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 88.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:59:40,608 INFO L158 Benchmark]: RCFGBuilder took 1194.24ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 100.9MB in the end (delta: -12.9MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-11-13 12:59:40,609 INFO L158 Benchmark]: TraceAbstraction took 29607.81ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 100.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 461.6MB. Max. memory is 16.1GB. [2024-11-13 12:59:40,609 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 189.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:59:40,611 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 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.30ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 93.8MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.13ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 94.51ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 88.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1194.24ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 100.9MB in the end (delta: -12.9MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29607.81ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 100.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 461.6MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 189.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, t1354=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0: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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0: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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L883] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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", "mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 839 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2022 IncrementalHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 32 mSDtfsCounter, 2022 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=9, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 2080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 12:59:40,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd --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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:59:43,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:59:43,452 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 12:59:43,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:59:43,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:59:43,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:59:43,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:59:43,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:59:43,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:59:43,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:59:43,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:59:43,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:59:43,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:59:43,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:59:43,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:59:43,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:59:43,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:59:43,515 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 12:59:43,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:59:43,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:59:43,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:59:43,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:59:43,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:59:43,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:59:43,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:59:43,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:59:43,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:59:43,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:59:43,517 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 12:59:43,517 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 12:59:43,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:59:43,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:59:43,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:59:43,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:59:43,522 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2024-11-13 12:59:43,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:59:43,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:59:43,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:59:43,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:59:43,828 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:59:43,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-13 12:59:45,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:59:46,095 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:59:46,096 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-13 12:59:46,117 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/data/ea633c3ff/a363442a30ab4e3f99d3ef3b2f7abddd/FLAG47833529a [2024-11-13 12:59:46,274 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/data/ea633c3ff/a363442a30ab4e3f99d3ef3b2f7abddd [2024-11-13 12:59:46,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:59:46,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:59:46,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:59:46,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:59:46,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:59:46,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:46,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ffe206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46, skipping insertion in model container [2024-11-13 12:59:46,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:46,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:59:46,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:59:46,809 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:59:46,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:59:46,910 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:59:46,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46 WrapperNode [2024-11-13 12:59:46,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:59:46,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:59:46,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:59:46,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:59:46,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:46,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:46,959 INFO L138 Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2024-11-13 12:59:46,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:59:46,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:59:46,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:59:46,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:59:46,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:46,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:46,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:47,005 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-13 12:59:47,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:47,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:47,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:47,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:47,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:47,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:47,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:59:47,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:59:47,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:59:47,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:59:47,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (1/1) ... [2024-11-13 12:59:47,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:59:47,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:47,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:59:47,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:59:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 12:59:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:59:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 12:59:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 12:59:47,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 12:59:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 12:59:47,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 12:59:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 12:59:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 12:59:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 12:59:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 12:59:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 12:59:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:59:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:59:47,112 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 12:59:47,307 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:59:47,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:59:47,757 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:59:47,758 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:59:48,089 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:59:48,091 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 12:59:48,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:59:48 BoogieIcfgContainer [2024-11-13 12:59:48,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:59:48,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:59:48,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:59:48,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:59:48,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:59:46" (1/3) ... [2024-11-13 12:59:48,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae5e3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:59:48, skipping insertion in model container [2024-11-13 12:59:48,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:46" (2/3) ... [2024-11-13 12:59:48,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae5e3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:59:48, skipping insertion in model container [2024-11-13 12:59:48,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:59:48" (3/3) ... [2024-11-13 12:59:48,102 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-13 12:59:48,117 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:59:48,119 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 12:59:48,119 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:59:48,212 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 12:59:48,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-13 12:59:48,301 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-13 12:59:48,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:59:48,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-13 12:59:48,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-13 12:59:48,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-13 12:59:48,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:59:48,338 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;@3f24a96d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:59:48,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 12:59:48,344 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 12:59:48,346 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 12:59:48,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:59:48,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:48,347 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 12:59:48,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:48,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 12800155, now seen corresponding path program 1 times [2024-11-13 12:59:48,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:59:48,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1431373016] [2024-11-13 12:59:48,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:48,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:48,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:48,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:48,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:59:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:48,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:59:48,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:48,551 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-13 12:59:48,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:48,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:59:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431373016] [2024-11-13 12:59:48,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431373016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:48,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:48,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:59:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901985255] [2024-11-13 12:59:48,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:48,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:48,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:59:48,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:48,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:48,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-13 12:59:48,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-13 12:59:48,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:48,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-13 12:59:48,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:50,092 INFO L124 PetriNetUnfolderBase]: 3311/5456 cut-off events. [2024-11-13 12:59:50,093 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-13 12:59:50,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10136 conditions, 5456 events. 3311/5456 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 39549 event pairs, 593 based on Foata normal form. 288/5705 useless extension candidates. Maximal degree in co-relation 10124. Up to 3661 conditions per place. [2024-11-13 12:59:50,135 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 41 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2024-11-13 12:59:50,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 241 flow [2024-11-13 12:59:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:59:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-11-13 12:59:50,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2024-11-13 12:59:50,150 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 122 transitions. [2024-11-13 12:59:50,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 241 flow [2024-11-13 12:59:50,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-13 12:59:50,163 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-13 12:59:50,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-13 12:59:50,173 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-13 12:59:50,173 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-13 12:59:50,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-13 12:59:50,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:50,174 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:50,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:59:50,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:50,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:50,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:50,382 INFO L85 PathProgramCache]: Analyzing trace with hash -234924269, now seen corresponding path program 1 times [2024-11-13 12:59:50,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:59:50,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205301504] [2024-11-13 12:59:50,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:50,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:50,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:50,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:50,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:59:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:50,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:59:50,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:50,575 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-13 12:59:50,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:50,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:59:50,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205301504] [2024-11-13 12:59:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205301504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:50,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:59:50,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803063716] [2024-11-13 12:59:50,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:59:50,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:50,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:50,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-13 12:59:50,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-13 12:59:50,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:50,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-13 12:59:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:51,439 INFO L124 PetriNetUnfolderBase]: 2903/4911 cut-off events. [2024-11-13 12:59:51,440 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-13 12:59:51,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9315 conditions, 4911 events. 2903/4911 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34952 event pairs, 2903 based on Foata normal form. 144/4916 useless extension candidates. Maximal degree in co-relation 9305. Up to 4016 conditions per place. [2024-11-13 12:59:51,474 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 22 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-13 12:59:51,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 146 flow [2024-11-13 12:59:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:59:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-13 12:59:51,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5911949685534591 [2024-11-13 12:59:51,478 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 94 transitions. [2024-11-13 12:59:51,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 146 flow [2024-11-13 12:59:51,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 12:59:51,481 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2024-11-13 12:59:51,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-13 12:59:51,483 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2024-11-13 12:59:51,484 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2024-11-13 12:59:51,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-13 12:59:51,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:51,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:51,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:59:51,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:51,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:51,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash -234922954, now seen corresponding path program 1 times [2024-11-13 12:59:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:59:51,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045091943] [2024-11-13 12:59:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:51,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:51,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:51,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:59:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:51,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 12:59:51,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:51,867 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-13 12:59:51,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:51,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:59:51,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045091943] [2024-11-13 12:59:51,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045091943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:51,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:51,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:59:51,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113425797] [2024-11-13 12:59:51,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:51,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:51,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:59:51,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:51,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:51,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:51,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:51,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:51,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:51,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:53,787 INFO L124 PetriNetUnfolderBase]: 8875/13615 cut-off events. [2024-11-13 12:59:53,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:59:53,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25937 conditions, 13615 events. 8875/13615 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 95754 event pairs, 1033 based on Foata normal form. 400/13929 useless extension candidates. Maximal degree in co-relation 25931. Up to 7301 conditions per place. [2024-11-13 12:59:53,871 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 53 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-11-13 12:59:53,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 284 flow [2024-11-13 12:59:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:59:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 12:59:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-11-13 12:59:53,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2024-11-13 12:59:53,875 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 4 states and 138 transitions. [2024-11-13 12:59:53,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 284 flow [2024-11-13 12:59:53,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 12:59:53,879 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 135 flow [2024-11-13 12:59:53,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-11-13 12:59:53,880 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2024-11-13 12:59:53,881 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 135 flow [2024-11-13 12:59:53,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:53,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:53,881 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] [2024-11-13 12:59:53,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:59:54,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:54,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:54,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1733073701, now seen corresponding path program 1 times [2024-11-13 12:59:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:59:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388866842] [2024-11-13 12:59:54,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:54,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:54,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:54,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:54,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:59:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:54,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:59:54,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:54,275 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-13 12:59:54,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:54,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:59:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388866842] [2024-11-13 12:59:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388866842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:54,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:54,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:59:54,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870056063] [2024-11-13 12:59:54,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:54,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:59:54,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:59:54,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:59:54,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:59:54,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:54,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:54,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:54,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:54,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:55,641 INFO L124 PetriNetUnfolderBase]: 6751/10375 cut-off events. [2024-11-13 12:59:55,642 INFO L125 PetriNetUnfolderBase]: For 2392/2392 co-relation queries the response was YES. [2024-11-13 12:59:55,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23232 conditions, 10375 events. 6751/10375 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 69057 event pairs, 451 based on Foata normal form. 364/10657 useless extension candidates. Maximal degree in co-relation 23223. Up to 4601 conditions per place. [2024-11-13 12:59:55,705 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 68 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-11-13 12:59:55,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 416 flow [2024-11-13 12:59:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:59:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 12:59:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-11-13 12:59:55,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6641509433962264 [2024-11-13 12:59:55,712 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 135 flow. Second operand 5 states and 176 transitions. [2024-11-13 12:59:55,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 416 flow [2024-11-13 12:59:55,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 405 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 12:59:55,718 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 187 flow [2024-11-13 12:59:55,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-13 12:59:55,722 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2024-11-13 12:59:55,722 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 187 flow [2024-11-13 12:59:55,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:55,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:55,722 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-13 12:59:55,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 12:59:55,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:55,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:55,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:55,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2106276919, now seen corresponding path program 1 times [2024-11-13 12:59:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:59:55,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652816978] [2024-11-13 12:59:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:55,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:55,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:55,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:55,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:59:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:56,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:59:56,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:56,145 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-13 12:59:56,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:56,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:59:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652816978] [2024-11-13 12:59:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652816978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:56,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:56,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:59:56,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141428821] [2024-11-13 12:59:56,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:56,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:59:56,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:59:56,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:59:56,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:59:56,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:56,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:56,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:56,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:56,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:57,097 INFO L124 PetriNetUnfolderBase]: 4259/6431 cut-off events. [2024-11-13 12:59:57,097 INFO L125 PetriNetUnfolderBase]: For 4590/4590 co-relation queries the response was YES. [2024-11-13 12:59:57,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16274 conditions, 6431 events. 4259/6431 cut-off events. For 4590/4590 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 37313 event pairs, 289 based on Foata normal form. 244/6593 useless extension candidates. Maximal degree in co-relation 16263. Up to 1788 conditions per place. [2024-11-13 12:59:57,131 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 81 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2024-11-13 12:59:57,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 547 flow [2024-11-13 12:59:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:59:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 12:59:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-11-13 12:59:57,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-13 12:59:57,133 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 187 flow. Second operand 6 states and 212 transitions. [2024-11-13 12:59:57,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 547 flow [2024-11-13 12:59:57,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 110 transitions, 517 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-13 12:59:57,161 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 237 flow [2024-11-13 12:59:57,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-13 12:59:57,163 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-11-13 12:59:57,164 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 237 flow [2024-11-13 12:59:57,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:57,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:57,164 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] [2024-11-13 12:59:57,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:59:57,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:57,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:57,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:57,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2090411985, now seen corresponding path program 1 times [2024-11-13 12:59:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:59:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494198169] [2024-11-13 12:59:57,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:57,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:57,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:57,373 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:57,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:59:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:57,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:59:57,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:57,571 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-13 12:59:57,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:57,571 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:59:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494198169] [2024-11-13 12:59:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494198169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:59:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80954724] [2024-11-13 12:59:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:57,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:59:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:59:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:59:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:57,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 12:59:57,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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-13 12:59:57,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:57,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 12:59:57,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:59:58,349 INFO L124 PetriNetUnfolderBase]: 2895/4199 cut-off events. [2024-11-13 12:59:58,349 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2024-11-13 12:59:58,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11675 conditions, 4199 events. 2895/4199 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 21674 event pairs, 231 based on Foata normal form. 96/4213 useless extension candidates. Maximal degree in co-relation 11663. Up to 1316 conditions per place. [2024-11-13 12:59:58,371 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 72 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-11-13 12:59:58,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 105 transitions, 537 flow [2024-11-13 12:59:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:59:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 12:59:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-11-13 12:59:58,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091644204851752 [2024-11-13 12:59:58,373 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 237 flow. Second operand 7 states and 226 transitions. [2024-11-13 12:59:58,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 105 transitions, 537 flow [2024-11-13 12:59:58,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 491 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-13 12:59:58,409 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 247 flow [2024-11-13 12:59:58,410 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-11-13 12:59:58,410 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2024-11-13 12:59:58,410 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 247 flow [2024-11-13 12:59:58,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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-13 12:59:58,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:59:58,411 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, 1, 1, 1] [2024-11-13 12:59:58,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 12:59:58,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:58,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 12:59:58,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1310091687, now seen corresponding path program 1 times [2024-11-13 12:59:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:59:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114009553] [2024-11-13 12:59:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:58,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:58,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:58,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:58,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:59:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:58,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 12:59:58,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:59,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:59,457 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:59:59,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114009553] [2024-11-13 12:59:59,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114009553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:59,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:59,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:59:59,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672025114] [2024-11-13 12:59:59,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:59,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:59:59,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:59:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:59:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:59:59,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-13 12:59:59,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 247 flow. Second operand has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 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-13 12:59:59,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:59:59,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-13 12:59:59,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:00:00,383 INFO L124 PetriNetUnfolderBase]: 2208/3578 cut-off events. [2024-11-13 13:00:00,383 INFO L125 PetriNetUnfolderBase]: For 2239/2363 co-relation queries the response was YES. [2024-11-13 13:00:00,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8776 conditions, 3578 events. 2208/3578 cut-off events. For 2239/2363 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 21427 event pairs, 543 based on Foata normal form. 16/3386 useless extension candidates. Maximal degree in co-relation 8763. Up to 1135 conditions per place. [2024-11-13 13:00:00,403 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 57 selfloop transitions, 5 changer transitions 21/112 dead transitions. [2024-11-13 13:00:00,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 555 flow [2024-11-13 13:00:00,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:00:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:00:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 304 transitions. [2024-11-13 13:00:00,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5735849056603773 [2024-11-13 13:00:00,405 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 247 flow. Second operand 10 states and 304 transitions. [2024-11-13 13:00:00,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 555 flow [2024-11-13 13:00:00,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 112 transitions, 446 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-13 13:00:00,427 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 177 flow [2024-11-13 13:00:00,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=177, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-11-13 13:00:00,428 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2024-11-13 13:00:00,428 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 177 flow [2024-11-13 13:00:00,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 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-13 13:00:00,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:00:00,428 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, 1, 1, 1] [2024-11-13 13:00:00,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:00:00,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:00,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 13:00:00,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash -966468757, now seen corresponding path program 2 times [2024-11-13 13:00:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:00:00,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443677444] [2024-11-13 13:00:00,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:00:00,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:00,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:00,637 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:00,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:00:00,758 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 13:00:00,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:00:00,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:00:00,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:00,831 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-13 13:00:00,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:00:00,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:00:00,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443677444] [2024-11-13 13:00:00,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443677444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:00,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:00,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:00:00,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371257191] [2024-11-13 13:00:00,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:00,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:00:00,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:00:00,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:00:00,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:00:00,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-13 13:00:00,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:00,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:00:00,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-13 13:00:00,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:00:01,779 INFO L124 PetriNetUnfolderBase]: 4567/7423 cut-off events. [2024-11-13 13:00:01,779 INFO L125 PetriNetUnfolderBase]: For 1188/1253 co-relation queries the response was YES. [2024-11-13 13:00:01,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15830 conditions, 7423 events. 4567/7423 cut-off events. For 1188/1253 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 51894 event pairs, 2059 based on Foata normal form. 29/6914 useless extension candidates. Maximal degree in co-relation 15817. Up to 3261 conditions per place. [2024-11-13 13:00:01,815 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 40 selfloop transitions, 2 changer transitions 21/90 dead transitions. [2024-11-13 13:00:01,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 398 flow [2024-11-13 13:00:01,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:00:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:00:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-11-13 13:00:01,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5723270440251572 [2024-11-13 13:00:01,818 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 177 flow. Second operand 6 states and 182 transitions. [2024-11-13 13:00:01,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 398 flow [2024-11-13 13:00:01,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 380 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-13 13:00:01,839 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 177 flow [2024-11-13 13:00:01,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-11-13 13:00:01,840 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2024-11-13 13:00:01,841 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 177 flow [2024-11-13 13:00:01,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:01,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:00:01,841 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, 1, 1, 1] [2024-11-13 13:00:01,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 13:00:02,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:02,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 13:00:02,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash 279207387, now seen corresponding path program 3 times [2024-11-13 13:00:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:00:02,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649342018] [2024-11-13 13:00:02,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:00:02,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:02,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:02,048 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:02,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:00:02,165 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 13:00:02,166 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:00:02,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:00:02,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:02,325 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-13 13:00:02,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:00:02,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:00:02,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649342018] [2024-11-13 13:00:02,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649342018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:02,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:02,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:00:02,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375440939] [2024-11-13 13:00:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:02,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:00:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:00:02,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:00:02,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:00:02,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 53 [2024-11-13 13:00:02,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 177 flow. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:02,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:00:02,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 53 [2024-11-13 13:00:02,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:00:04,010 INFO L124 PetriNetUnfolderBase]: 11411/16506 cut-off events. [2024-11-13 13:00:04,010 INFO L125 PetriNetUnfolderBase]: For 3256/3256 co-relation queries the response was YES. [2024-11-13 13:00:04,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38509 conditions, 16506 events. 11411/16506 cut-off events. For 3256/3256 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 98849 event pairs, 929 based on Foata normal form. 16/16372 useless extension candidates. Maximal degree in co-relation 38496. Up to 7100 conditions per place. [2024-11-13 13:00:04,058 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 72 selfloop transitions, 10 changer transitions 61/155 dead transitions. [2024-11-13 13:00:04,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 155 transitions, 758 flow [2024-11-13 13:00:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:00:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:00:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 285 transitions. [2024-11-13 13:00:04,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5377358490566038 [2024-11-13 13:00:04,061 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 177 flow. Second operand 10 states and 285 transitions. [2024-11-13 13:00:04,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 155 transitions, 758 flow [2024-11-13 13:00:04,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 155 transitions, 734 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-13 13:00:04,068 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 221 flow [2024-11-13 13:00:04,068 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=221, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-11-13 13:00:04,069 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2024-11-13 13:00:04,069 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 221 flow [2024-11-13 13:00:04,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:04,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:00:04,069 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, 1, 1, 1] [2024-11-13 13:00:04,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:00:04,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:04,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 13:00:04,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:04,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1193552309, now seen corresponding path program 4 times [2024-11-13 13:00:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:00:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120215639] [2024-11-13 13:00:04,275 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 13:00:04,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:04,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:04,277 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:04,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:00:04,383 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 13:00:04,383 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:00:04,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:00:04,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:04,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-13 13:00:04,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:00:04,484 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:00:04,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120215639] [2024-11-13 13:00:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120215639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:04,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:00:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245590622] [2024-11-13 13:00:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:04,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:00:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:00:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:00:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:00:04,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-13 13:00:04,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-13 13:00:04,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:00:04,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-13 13:00:04,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:00:05,441 INFO L124 PetriNetUnfolderBase]: 7408/11847 cut-off events. [2024-11-13 13:00:05,441 INFO L125 PetriNetUnfolderBase]: For 1843/1875 co-relation queries the response was YES. [2024-11-13 13:00:05,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24851 conditions, 11847 events. 7408/11847 cut-off events. For 1843/1875 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 85269 event pairs, 1592 based on Foata normal form. 16/11044 useless extension candidates. Maximal degree in co-relation 24835. Up to 4214 conditions per place. [2024-11-13 13:00:05,476 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 44 selfloop transitions, 2 changer transitions 18/96 dead transitions. [2024-11-13 13:00:05,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 437 flow [2024-11-13 13:00:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:00:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:00:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2024-11-13 13:00:05,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5525606469002695 [2024-11-13 13:00:05,478 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 221 flow. Second operand 7 states and 205 transitions. [2024-11-13 13:00:05,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 437 flow [2024-11-13 13:00:05,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 415 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-13 13:00:05,482 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 224 flow [2024-11-13 13:00:05,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2024-11-13 13:00:05,483 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2024-11-13 13:00:05,483 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 224 flow [2024-11-13 13:00:05,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-13 13:00:05,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:00:05,484 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, 1, 1, 1] [2024-11-13 13:00:05,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:00:05,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:05,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 13:00:05,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash -728236337, now seen corresponding path program 5 times [2024-11-13 13:00:05,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:00:05,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509785151] [2024-11-13 13:00:05,685 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 13:00:05,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:05,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:05,686 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:05,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:00:05,795 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 13:00:05,795 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 13:00:05,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:00:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:05,917 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 13:00:05,917 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:00:05,918 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-13 13:00:05,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-13 13:00:05,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-13 13:00:05,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-13 13:00:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-13 13:00:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-13 13:00:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-13 13:00:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-13 13:00:05,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:00:06,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:06,121 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:06,247 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 13:00:06,247 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:00:06,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:00:06 BasicIcfg [2024-11-13 13:00:06,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:00:06,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:00:06,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:00:06,260 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:00:06,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:59:48" (3/4) ... [2024-11-13 13:00:06,263 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:00:06,264 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:00:06,266 INFO L158 Benchmark]: Toolchain (without parser) took 19987.34ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 90.8MB in the beginning and 752.6MB in the end (delta: -661.9MB). Peak memory consumption was 528.7MB. Max. memory is 16.1GB. [2024-11-13 13:00:06,266 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:00:06,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.34ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 66.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:00:06,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.38ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:00:06,267 INFO L158 Benchmark]: Boogie Preprocessor took 79.49ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 61.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:00:06,268 INFO L158 Benchmark]: RCFGBuilder took 1050.93ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 79.6MB in the end (delta: -18.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-11-13 13:00:06,268 INFO L158 Benchmark]: TraceAbstraction took 18165.53ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 78.9MB in the beginning and 753.3MB in the end (delta: -674.3MB). Peak memory consumption was 514.0MB. Max. memory is 16.1GB. [2024-11-13 13:00:06,269 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 1.3GB. Free memory was 753.3MB in the beginning and 752.6MB in the end (delta: 630.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:00:06,271 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.33ms. Allocated memory is still 117.4MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.34ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 66.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.38ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.49ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 61.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1050.93ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 79.6MB in the end (delta: -18.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18165.53ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 78.9MB in the beginning and 753.3MB in the end (delta: -674.3MB). Peak memory consumption was 514.0MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 1.3GB. Free memory was 753.3MB in the beginning and 752.6MB in the end (delta: 630.9kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, t1354=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}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0: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_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L883] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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", "mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 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: 17.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 670 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2159 IncrementalHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 18 mSDtfsCounter, 2159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=6, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 304 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 1052 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1190 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-13 13:00:06,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f40816-d60e-4ef4-bcd9-ea64031acec4/bin/uautomizer-verify-qhAvR1uOyd/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