./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC --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 d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:48:25,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:48:25,828 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-24 00:48:25,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:48:25,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:48:25,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:48:25,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:48:25,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:48:25,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:48:25,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:48:25,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:48:25,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:48:25,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:48:25,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:48:25,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:48:25,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:48:25,862 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:48:25,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:48:25,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:48:25,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:48:25,863 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 00:48:25,863 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 00:48:25,863 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 00:48:25,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:48:25,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:48:25,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 00:48:25,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:48:25,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:48:25,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:48:25,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:48:25,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:48:25,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:48:25,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:48:25,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:48:25,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:48:25,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:48:25,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:48:25,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:48:25,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:48:25,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:48:25,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:48:25,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:48:25,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:48:25,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:48:25,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:48:25,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:48:25,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:48:25,866 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_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC 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 -> d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 [2024-11-24 00:48:26,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:48:26,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:48:26,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:48:26,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:48:26,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:48:26,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-11-24 00:48:29,177 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data/c2b2624e3/12fe95fa4a6e423dba591889de0f779f/FLAGd31aa2123 [2024-11-24 00:48:29,532 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:48:29,533 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-11-24 00:48:29,559 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data/c2b2624e3/12fe95fa4a6e423dba591889de0f779f/FLAGd31aa2123 [2024-11-24 00:48:29,757 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data/c2b2624e3/12fe95fa4a6e423dba591889de0f779f [2024-11-24 00:48:29,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:48:29,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:48:29,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:48:29,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:48:29,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:48:29,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:48:29" (1/1) ... [2024-11-24 00:48:29,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1907f40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:29, skipping insertion in model container [2024-11-24 00:48:29,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:48:29" (1/1) ... [2024-11-24 00:48:29,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:48:30,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:48:30,198 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:48:30,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:48:30,324 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:48:30,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30 WrapperNode [2024-11-24 00:48:30,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:48:30,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:48:30,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:48:30,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:48:30,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,379 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2024-11-24 00:48:30,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:48:30,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:48:30,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:48:30,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:48:30,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,412 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-24 00:48:30,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:48:30,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:48:30,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:48:30,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:48:30,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (1/1) ... [2024-11-24 00:48:30,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:48:30,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:48:30,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:48:30,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:48:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 00:48:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:48:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 00:48:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 00:48:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 00:48:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 00:48:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-24 00:48:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-24 00:48:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:48:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 00:48:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:48:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:48:30,525 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:48:30,708 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:48:30,711 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:48:31,109 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:48:31,110 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:48:31,382 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:48:31,382 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:48:31,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:48:31 BoogieIcfgContainer [2024-11-24 00:48:31,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:48:31,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:48:31,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:48:31,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:48:31,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:48:29" (1/3) ... [2024-11-24 00:48:31,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a395c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:48:31, skipping insertion in model container [2024-11-24 00:48:31,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:30" (2/3) ... [2024-11-24 00:48:31,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a395c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:48:31, skipping insertion in model container [2024-11-24 00:48:31,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:48:31" (3/3) ... [2024-11-24 00:48:31,394 INFO L128 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-11-24 00:48:31,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:48:31,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-24 00:48:31,413 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:48:31,489 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 00:48:31,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-24 00:48:31,584 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-24 00:48:31,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:48:31,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-24 00:48:31,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-24 00:48:31,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-24 00:48:31,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:48:31,626 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;@73b6791c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:48:31,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-24 00:48:31,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:48:31,634 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-24 00:48:31,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:48:31,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:31,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-24 00:48:31,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:31,642 INFO L85 PathProgramCache]: Analyzing trace with hash 11973184, now seen corresponding path program 1 times [2024-11-24 00:48:31,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:31,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968569165] [2024-11-24 00:48:31,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:31,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:32,255 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-24 00:48:32,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968569165] [2024-11-24 00:48:32,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968569165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:32,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:48:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358115198] [2024-11-24 00:48:32,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:32,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:48:32,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:32,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:48:32,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:48:32,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-24 00:48:32,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:32,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:32,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-24 00:48:32,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:33,034 INFO L124 PetriNetUnfolderBase]: 825/1453 cut-off events. [2024-11-24 00:48:33,036 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-24 00:48:33,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2734 conditions, 1453 events. 825/1453 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8540 event pairs, 457 based on Foata normal form. 96/1534 useless extension candidates. Maximal degree in co-relation 2723. Up to 1009 conditions per place. [2024-11-24 00:48:33,061 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 33 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2024-11-24 00:48:33,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 197 flow [2024-11-24 00:48:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:48:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:48:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-24 00:48:33,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2024-11-24 00:48:33,081 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 102 transitions. [2024-11-24 00:48:33,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 197 flow [2024-11-24 00:48:33,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 00:48:33,095 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-24 00:48:33,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-24 00:48:33,106 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-24 00:48:33,107 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-24 00:48:33,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:33,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:33,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:33,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:48:33,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:33,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:33,110 INFO L85 PathProgramCache]: Analyzing trace with hash 670418477, now seen corresponding path program 1 times [2024-11-24 00:48:33,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:33,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238283765] [2024-11-24 00:48:33,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:33,255 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-24 00:48:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:33,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238283765] [2024-11-24 00:48:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238283765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:33,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:48:33,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923945848] [2024-11-24 00:48:33,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:33,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:48:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:33,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:48:33,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:48:33,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-24 00:48:33,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-24 00:48:33,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:33,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-24 00:48:33,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:33,725 INFO L124 PetriNetUnfolderBase]: 721/1385 cut-off events. [2024-11-24 00:48:33,725 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-24 00:48:33,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1385 events. 721/1385 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8893 event pairs, 721 based on Foata normal form. 48/1379 useless extension candidates. Maximal degree in co-relation 2595. Up to 1090 conditions per place. [2024-11-24 00:48:33,740 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 18 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-24 00:48:33,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 122 flow [2024-11-24 00:48:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:48:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:48:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-24 00:48:33,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-24 00:48:33,742 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 78 transitions. [2024-11-24 00:48:33,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 122 flow [2024-11-24 00:48:33,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:48:33,744 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-24 00:48:33,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-24 00:48:33,746 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-24 00:48:33,746 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-24 00:48:33,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-24 00:48:33,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:33,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:33,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:48:33,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:33,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash 670420027, now seen corresponding path program 1 times [2024-11-24 00:48:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:33,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35550021] [2024-11-24 00:48:33,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:48:34,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:34,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35550021] [2024-11-24 00:48:34,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35550021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:34,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:34,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:48:34,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988844932] [2024-11-24 00:48:34,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:34,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:48:34,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:34,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:48:34,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:48:34,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-24 00:48:34,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:34,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:34,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-24 00:48:34,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:34,891 INFO L124 PetriNetUnfolderBase]: 1280/2160 cut-off events. [2024-11-24 00:48:34,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:48:34,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4123 conditions, 2160 events. 1280/2160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13503 event pairs, 205 based on Foata normal form. 0/2082 useless extension candidates. Maximal degree in co-relation 4117. Up to 1065 conditions per place. [2024-11-24 00:48:34,907 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 27 selfloop transitions, 2 changer transitions 42/84 dead transitions. [2024-11-24 00:48:34,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 84 transitions, 318 flow [2024-11-24 00:48:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:48:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 00:48:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-11-24 00:48:34,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805555555555556 [2024-11-24 00:48:34,911 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 8 states and 209 transitions. [2024-11-24 00:48:34,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 84 transitions, 318 flow [2024-11-24 00:48:34,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:48:34,914 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 91 flow [2024-11-24 00:48:34,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=91, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2024-11-24 00:48:34,915 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-24 00:48:34,915 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 91 flow [2024-11-24 00:48:34,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:34,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:34,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:34,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:48:34,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:34,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 598582520, now seen corresponding path program 1 times [2024-11-24 00:48:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388190060] [2024-11-24 00:48:34,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:35,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-24 00:48:35,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:35,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388190060] [2024-11-24 00:48:35,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388190060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:48:35,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629662391] [2024-11-24 00:48:35,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:35,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:48:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:35,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:48:35,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:48:35,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-24 00:48:35,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:35,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:35,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-24 00:48:35,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:36,733 INFO L124 PetriNetUnfolderBase]: 4050/6520 cut-off events. [2024-11-24 00:48:36,734 INFO L125 PetriNetUnfolderBase]: For 1368/1368 co-relation queries the response was YES. [2024-11-24 00:48:36,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14111 conditions, 6520 events. 4050/6520 cut-off events. For 1368/1368 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 42861 event pairs, 438 based on Foata normal form. 166/6684 useless extension candidates. Maximal degree in co-relation 14099. Up to 2560 conditions per place. [2024-11-24 00:48:36,779 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 51 selfloop transitions, 9 changer transitions 61/130 dead transitions. [2024-11-24 00:48:36,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 130 transitions, 561 flow [2024-11-24 00:48:36,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:48:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 00:48:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2024-11-24 00:48:36,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2024-11-24 00:48:36,786 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 91 flow. Second operand 10 states and 254 transitions. [2024-11-24 00:48:36,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 130 transitions, 561 flow [2024-11-24 00:48:36,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 130 transitions, 525 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-24 00:48:36,927 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 168 flow [2024-11-24 00:48:36,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=168, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2024-11-24 00:48:36,928 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-24 00:48:36,929 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 168 flow [2024-11-24 00:48:36,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:36,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:36,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:36,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 00:48:36,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1769655399, now seen corresponding path program 1 times [2024-11-24 00:48:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:36,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769925278] [2024-11-24 00:48:36,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:37,130 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-24 00:48:37,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:37,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769925278] [2024-11-24 00:48:37,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769925278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:37,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:37,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:48:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302154009] [2024-11-24 00:48:37,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:37,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:48:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:37,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:48:37,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:48:37,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-24 00:48:37,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-24 00:48:37,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:37,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-24 00:48:37,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:38,355 INFO L124 PetriNetUnfolderBase]: 4128/6942 cut-off events. [2024-11-24 00:48:38,355 INFO L125 PetriNetUnfolderBase]: For 4981/5643 co-relation queries the response was YES. [2024-11-24 00:48:38,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16688 conditions, 6942 events. 4128/6942 cut-off events. For 4981/5643 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 47443 event pairs, 675 based on Foata normal form. 503/7202 useless extension candidates. Maximal degree in co-relation 16671. Up to 3645 conditions per place. [2024-11-24 00:48:38,415 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 46 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2024-11-24 00:48:38,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 348 flow [2024-11-24 00:48:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:48:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:48:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-11-24 00:48:38,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-24 00:48:38,419 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 168 flow. Second operand 4 states and 114 transitions. [2024-11-24 00:48:38,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 348 flow [2024-11-24 00:48:38,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 344 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-24 00:48:38,431 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 202 flow [2024-11-24 00:48:38,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-24 00:48:38,434 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2024-11-24 00:48:38,434 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 202 flow [2024-11-24 00:48:38,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-24 00:48:38,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:38,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:38,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:48:38,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:38,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1408143521, now seen corresponding path program 1 times [2024-11-24 00:48:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:38,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840178104] [2024-11-24 00:48:38,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:38,774 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-24 00:48:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:38,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840178104] [2024-11-24 00:48:38,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840178104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:38,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:38,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:48:38,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146619301] [2024-11-24 00:48:38,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:38,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:48:38,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:38,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:48:38,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:48:38,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-24 00:48:38,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:38,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:38,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-24 00:48:38,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:40,552 INFO L124 PetriNetUnfolderBase]: 5849/9882 cut-off events. [2024-11-24 00:48:40,552 INFO L125 PetriNetUnfolderBase]: For 7286/7660 co-relation queries the response was YES. [2024-11-24 00:48:40,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26544 conditions, 9882 events. 5849/9882 cut-off events. For 7286/7660 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 73646 event pairs, 1411 based on Foata normal form. 225/9635 useless extension candidates. Maximal degree in co-relation 26525. Up to 3281 conditions per place. [2024-11-24 00:48:40,629 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 72 selfloop transitions, 21 changer transitions 32/138 dead transitions. [2024-11-24 00:48:40,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 138 transitions, 780 flow [2024-11-24 00:48:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:48:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 00:48:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-11-24 00:48:40,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2024-11-24 00:48:40,632 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 202 flow. Second operand 10 states and 249 transitions. [2024-11-24 00:48:40,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 138 transitions, 780 flow [2024-11-24 00:48:40,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 778 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:48:40,662 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 390 flow [2024-11-24 00:48:40,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=390, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2024-11-24 00:48:40,664 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2024-11-24 00:48:40,664 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 390 flow [2024-11-24 00:48:40,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:40,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:40,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:40,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:48:40,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:40,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1388059570, now seen corresponding path program 1 times [2024-11-24 00:48:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:40,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147061343] [2024-11-24 00:48:40,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:41,047 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-24 00:48:41,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:41,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147061343] [2024-11-24 00:48:41,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147061343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:41,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:41,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:48:41,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801084279] [2024-11-24 00:48:41,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:41,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:48:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:41,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:48:41,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:48:41,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-24 00:48:41,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:41,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:41,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-24 00:48:41,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:43,110 INFO L124 PetriNetUnfolderBase]: 8081/13741 cut-off events. [2024-11-24 00:48:43,110 INFO L125 PetriNetUnfolderBase]: For 24835/25510 co-relation queries the response was YES. [2024-11-24 00:48:43,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41225 conditions, 13741 events. 8081/13741 cut-off events. For 24835/25510 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 109970 event pairs, 1708 based on Foata normal form. 172/13270 useless extension candidates. Maximal degree in co-relation 41197. Up to 5078 conditions per place. [2024-11-24 00:48:43,183 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 60 selfloop transitions, 14 changer transitions 31/118 dead transitions. [2024-11-24 00:48:43,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 118 transitions, 884 flow [2024-11-24 00:48:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:48:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:48:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-11-24 00:48:43,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-24 00:48:43,184 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 390 flow. Second operand 6 states and 162 transitions. [2024-11-24 00:48:43,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 118 transitions, 884 flow [2024-11-24 00:48:43,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 118 transitions, 866 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-24 00:48:43,398 INFO L231 Difference]: Finished difference. Result has 82 places, 59 transitions, 401 flow [2024-11-24 00:48:43,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=401, PETRI_PLACES=82, PETRI_TRANSITIONS=59} [2024-11-24 00:48:43,400 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2024-11-24 00:48:43,401 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 59 transitions, 401 flow [2024-11-24 00:48:43,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:43,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:43,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:43,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:48:43,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:43,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash 857716582, now seen corresponding path program 2 times [2024-11-24 00:48:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:43,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555361262] [2024-11-24 00:48:43,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:48:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:43,465 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:48:43,469 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:48:43,671 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-24 00:48:43,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555361262] [2024-11-24 00:48:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555361262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:48:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460407805] [2024-11-24 00:48:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:43,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:48:43,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:43,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:48:43,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:48:43,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-24 00:48:43,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 59 transitions, 401 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-24 00:48:43,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:43,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-24 00:48:43,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:45,137 INFO L124 PetriNetUnfolderBase]: 5859/9773 cut-off events. [2024-11-24 00:48:45,137 INFO L125 PetriNetUnfolderBase]: For 12319/12707 co-relation queries the response was YES. [2024-11-24 00:48:45,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26499 conditions, 9773 events. 5859/9773 cut-off events. For 12319/12707 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 69143 event pairs, 779 based on Foata normal form. 662/10200 useless extension candidates. Maximal degree in co-relation 26466. Up to 2944 conditions per place. [2024-11-24 00:48:45,189 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 57 selfloop transitions, 8 changer transitions 11/101 dead transitions. [2024-11-24 00:48:45,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 101 transitions, 728 flow [2024-11-24 00:48:45,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:48:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:48:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-24 00:48:45,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-11-24 00:48:45,191 INFO L175 Difference]: Start difference. First operand has 82 places, 59 transitions, 401 flow. Second operand 5 states and 145 transitions. [2024-11-24 00:48:45,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 101 transitions, 728 flow [2024-11-24 00:48:45,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 688 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-11-24 00:48:45,234 INFO L231 Difference]: Finished difference. Result has 82 places, 57 transitions, 375 flow [2024-11-24 00:48:45,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=82, PETRI_TRANSITIONS=57} [2024-11-24 00:48:45,235 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2024-11-24 00:48:45,235 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 57 transitions, 375 flow [2024-11-24 00:48:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-24 00:48:45,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:45,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:45,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:48:45,236 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:45,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1332826758, now seen corresponding path program 1 times [2024-11-24 00:48:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:45,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141431313] [2024-11-24 00:48:45,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:45,617 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-24 00:48:45,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:45,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141431313] [2024-11-24 00:48:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141431313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:45,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:48:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813652959] [2024-11-24 00:48:45,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:45,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:48:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:45,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:48:45,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:48:45,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-24 00:48:45,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 57 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-24 00:48:45,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:45,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-24 00:48:45,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:46,608 INFO L124 PetriNetUnfolderBase]: 3959/6625 cut-off events. [2024-11-24 00:48:46,608 INFO L125 PetriNetUnfolderBase]: For 11609/11833 co-relation queries the response was YES. [2024-11-24 00:48:46,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20167 conditions, 6625 events. 3959/6625 cut-off events. For 11609/11833 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 45475 event pairs, 611 based on Foata normal form. 282/6687 useless extension candidates. Maximal degree in co-relation 20134. Up to 2388 conditions per place. [2024-11-24 00:48:46,642 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 50 selfloop transitions, 11 changer transitions 6/86 dead transitions. [2024-11-24 00:48:46,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 86 transitions, 590 flow [2024-11-24 00:48:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:48:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:48:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-11-24 00:48:46,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851851851851851 [2024-11-24 00:48:46,644 INFO L175 Difference]: Start difference. First operand has 82 places, 57 transitions, 375 flow. Second operand 6 states and 158 transitions. [2024-11-24 00:48:46,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 86 transitions, 590 flow [2024-11-24 00:48:46,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 508 flow, removed 28 selfloop flow, removed 14 redundant places. [2024-11-24 00:48:46,664 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 309 flow [2024-11-24 00:48:46,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2024-11-24 00:48:46,665 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2024-11-24 00:48:46,665 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 309 flow [2024-11-24 00:48:46,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-24 00:48:46,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:46,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:46,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:48:46,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:46,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:46,667 INFO L85 PathProgramCache]: Analyzing trace with hash 666053679, now seen corresponding path program 1 times [2024-11-24 00:48:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576861656] [2024-11-24 00:48:46,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:46,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:48,036 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-24 00:48:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576861656] [2024-11-24 00:48:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576861656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 00:48:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816244221] [2024-11-24 00:48:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:48,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 00:48:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:48,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 00:48:48,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:48:48,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-24 00:48:48,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 309 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 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-24 00:48:48,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:48,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-24 00:48:48,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:48,982 INFO L124 PetriNetUnfolderBase]: 1725/3287 cut-off events. [2024-11-24 00:48:48,982 INFO L125 PetriNetUnfolderBase]: For 5467/6002 co-relation queries the response was YES. [2024-11-24 00:48:48,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9619 conditions, 3287 events. 1725/3287 cut-off events. For 5467/6002 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 23283 event pairs, 290 based on Foata normal form. 75/3076 useless extension candidates. Maximal degree in co-relation 9596. Up to 890 conditions per place. [2024-11-24 00:48:49,002 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 32 selfloop transitions, 6 changer transitions 84/140 dead transitions. [2024-11-24 00:48:49,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 140 transitions, 918 flow [2024-11-24 00:48:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:48:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-24 00:48:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 257 transitions. [2024-11-24 00:48:49,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5191919191919192 [2024-11-24 00:48:49,004 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 309 flow. Second operand 11 states and 257 transitions. [2024-11-24 00:48:49,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 140 transitions, 918 flow [2024-11-24 00:48:49,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 140 transitions, 875 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-24 00:48:49,030 INFO L231 Difference]: Finished difference. Result has 83 places, 43 transitions, 251 flow [2024-11-24 00:48:49,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=251, PETRI_PLACES=83, PETRI_TRANSITIONS=43} [2024-11-24 00:48:49,031 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-24 00:48:49,032 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 43 transitions, 251 flow [2024-11-24 00:48:49,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 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-24 00:48:49,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:49,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:49,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 00:48:49,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:49,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 880999129, now seen corresponding path program 2 times [2024-11-24 00:48:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:49,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5403911] [2024-11-24 00:48:49,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:48:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:49,147 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:48:49,147 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 00:48:49,147 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:48:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:48:49,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:48:49,336 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:48:49,337 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-24 00:48:49,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-24 00:48:49,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-24 00:48:49,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-24 00:48:49,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-24 00:48:49,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-24 00:48:49,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-24 00:48:49,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 00:48:49,345 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:49,450 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 00:48:49,453 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:48:49,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:48:49 BasicIcfg [2024-11-24 00:48:49,462 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:48:49,462 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:48:49,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:48:49,463 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:48:49,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:48:31" (3/4) ... [2024-11-24 00:48:49,466 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:48:49,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:48:49,469 INFO L158 Benchmark]: Toolchain (without parser) took 19707.77ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 93.7MB in the beginning and 808.6MB in the end (delta: -714.9MB). Peak memory consumption was 429.1MB. Max. memory is 16.1GB. [2024-11-24 00:48:49,470 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:48:49,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.58ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 70.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:48:49,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.58ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 68.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:48:49,471 INFO L158 Benchmark]: Boogie Preprocessor took 60.56ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 64.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:48:49,472 INFO L158 Benchmark]: RCFGBuilder took 937.60ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 68.8MB in the end (delta: -3.8MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-11-24 00:48:49,472 INFO L158 Benchmark]: TraceAbstraction took 18076.32ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 68.2MB in the beginning and 808.8MB in the end (delta: -740.6MB). Peak memory consumption was 398.8MB. Max. memory is 16.1GB. [2024-11-24 00:48:49,473 INFO L158 Benchmark]: Witness Printer took 5.99ms. Allocated memory is still 1.3GB. Free memory was 808.8MB in the beginning and 808.6MB in the end (delta: 171.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:48:49,475 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.43ms. Allocated memory is still 142.6MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.58ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 70.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.58ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 68.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.56ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 64.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 937.60ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 68.8MB in the end (delta: -3.8MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18076.32ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 68.2MB in the beginning and 808.8MB in the end (delta: -740.6MB). Peak memory consumption was 398.8MB. Max. memory is 16.1GB. * Witness Printer took 5.99ms. Allocated memory is still 1.3GB. Free memory was 808.8MB in the beginning and 808.6MB in the end (delta: 171.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t745; [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t746; [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745=-2, t746=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t747; [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t745=-2, t746=-1, t747=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745=-2, t746=-1, t747=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745=-2, t746=-1, t747=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745=-2, t746=-1, t747=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix028_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 841]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1350 IncrementalHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 54 mSDtfsCounter, 1350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=401occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 00:48:49,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC --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 d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:48:52,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:48:52,556 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-24 00:48:52,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:48:52,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:48:52,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:48:52,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:48:52,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:48:52,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:48:52,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:48:52,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:48:52,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:48:52,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:48:52,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:48:52,605 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:48:52,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:48:52,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 00:48:52,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 00:48:52,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:48:52,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:48:52,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:48:52,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:48:52,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:48:52,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:48:52,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:48:52,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:48:52,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:48:52,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:48:52,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:48:52,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:48:52,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:48:52,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:48:52,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:48:52,608 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 00:48:52,608 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 00:48:52,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:48:52,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:48:52,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:48:52,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:48:52,609 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_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC 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 -> d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 [2024-11-24 00:48:52,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:48:52,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:48:52,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:48:52,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:48:52,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:48:52,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-11-24 00:48:55,923 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data/23f3a5dad/781b760bf2a34d0dbd1bbfaf224b46d6/FLAGa0a1dd142 [2024-11-24 00:48:56,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:48:56,265 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-11-24 00:48:56,280 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data/23f3a5dad/781b760bf2a34d0dbd1bbfaf224b46d6/FLAGa0a1dd142 [2024-11-24 00:48:56,510 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/data/23f3a5dad/781b760bf2a34d0dbd1bbfaf224b46d6 [2024-11-24 00:48:56,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:48:56,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:48:56,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:48:56,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:48:56,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:48:56,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:48:56" (1/1) ... [2024-11-24 00:48:56,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef83993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:56, skipping insertion in model container [2024-11-24 00:48:56,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:48:56" (1/1) ... [2024-11-24 00:48:56,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:48:57,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:48:57,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:48:57,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:48:57,230 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:48:57,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57 WrapperNode [2024-11-24 00:48:57,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:48:57,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:48:57,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:48:57,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:48:57,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,296 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-11-24 00:48:57,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:48:57,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:48:57,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:48:57,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:48:57,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,332 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-24 00:48:57,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:48:57,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:48:57,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:48:57,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:48:57,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (1/1) ... [2024-11-24 00:48:57,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:48:57,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:48:57,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:48:57,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:48:57,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 00:48:57,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:48:57,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 00:48:57,436 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 00:48:57,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 00:48:57,437 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 00:48:57,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 00:48:57,437 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-24 00:48:57,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-24 00:48:57,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 00:48:57,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:48:57,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:48:57,442 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:48:57,614 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:48:57,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:48:58,049 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:48:58,050 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:48:58,372 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:48:58,373 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:48:58,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:48:58 BoogieIcfgContainer [2024-11-24 00:48:58,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:48:58,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:48:58,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:48:58,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:48:58,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:48:56" (1/3) ... [2024-11-24 00:48:58,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e38860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:48:58, skipping insertion in model container [2024-11-24 00:48:58,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:48:57" (2/3) ... [2024-11-24 00:48:58,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e38860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:48:58, skipping insertion in model container [2024-11-24 00:48:58,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:48:58" (3/3) ... [2024-11-24 00:48:58,386 INFO L128 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-11-24 00:48:58,402 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:48:58,403 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-24 00:48:58,404 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:48:58,481 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 00:48:58,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-24 00:48:58,588 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-24 00:48:58,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:48:58,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-24 00:48:58,596 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-24 00:48:58,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-24 00:48:58,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:48:58,637 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;@187af99c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:48:58,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-24 00:48:58,644 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:48:58,645 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-24 00:48:58,645 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:48:58,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:58,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-24 00:48:58,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:58,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash 12034752, now seen corresponding path program 1 times [2024-11-24 00:48:58,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:48:58,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856971883] [2024-11-24 00:48:58,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:58,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:48:58,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:48:58,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:48:58,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 00:48:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:58,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 00:48:58,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:48:58,853 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-24 00:48:58,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:48:58,854 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:48:58,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856971883] [2024-11-24 00:48:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856971883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:58,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:58,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:48:58,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405313564] [2024-11-24 00:48:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:58,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:48:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:48:58,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:48:58,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:48:58,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-24 00:48:58,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:58,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:58,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-24 00:48:58,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:59,539 INFO L124 PetriNetUnfolderBase]: 825/1530 cut-off events. [2024-11-24 00:48:59,539 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-24 00:48:59,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2811 conditions, 1530 events. 825/1530 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9937 event pairs, 129 based on Foata normal form. 96/1609 useless extension candidates. Maximal degree in co-relation 2800. Up to 1009 conditions per place. [2024-11-24 00:48:59,554 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 33 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2024-11-24 00:48:59,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 197 flow [2024-11-24 00:48:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:48:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:48:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-24 00:48:59,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2024-11-24 00:48:59,576 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 102 transitions. [2024-11-24 00:48:59,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 197 flow [2024-11-24 00:48:59,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 00:48:59,587 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-24 00:48:59,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-24 00:48:59,596 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-24 00:48:59,596 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-24 00:48:59,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:59,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:59,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:59,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 00:48:59,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:48:59,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:48:59,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 63720559, now seen corresponding path program 1 times [2024-11-24 00:48:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:48:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813772315] [2024-11-24 00:48:59,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:59,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:48:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:48:59,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:48:59,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 00:48:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:59,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 00:48:59,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:48:59,951 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-24 00:48:59,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:48:59,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:48:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813772315] [2024-11-24 00:48:59,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813772315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:59,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:59,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:48:59,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184097105] [2024-11-24 00:48:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:59,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:48:59,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:48:59,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:48:59,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:48:59,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-24 00:48:59,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-24 00:48:59,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:59,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-24 00:48:59,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:49:00,287 INFO L124 PetriNetUnfolderBase]: 721/1385 cut-off events. [2024-11-24 00:49:00,287 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-24 00:49:00,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1385 events. 721/1385 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8889 event pairs, 721 based on Foata normal form. 48/1379 useless extension candidates. Maximal degree in co-relation 2595. Up to 1090 conditions per place. [2024-11-24 00:49:00,298 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 18 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-24 00:49:00,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 122 flow [2024-11-24 00:49:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:49:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:49:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-24 00:49:00,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-24 00:49:00,300 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 78 transitions. [2024-11-24 00:49:00,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 122 flow [2024-11-24 00:49:00,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:49:00,302 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-24 00:49:00,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-24 00:49:00,303 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-24 00:49:00,303 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-24 00:49:00,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-24 00:49:00,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:49:00,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:00,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 00:49:00,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:00,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:49:00,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:00,506 INFO L85 PathProgramCache]: Analyzing trace with hash 63722109, now seen corresponding path program 1 times [2024-11-24 00:49:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:49:00,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711988472] [2024-11-24 00:49:00,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:00,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:00,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:00,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:00,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 00:49:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:00,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:49:00,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:49:00,654 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-24 00:49:00,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:49:00,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:49:00,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711988472] [2024-11-24 00:49:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711988472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:00,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:00,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:49:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715106451] [2024-11-24 00:49:00,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:00,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:49:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:49:00,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:49:00,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:49:00,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-24 00:49:00,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-24 00:49:00,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:49:00,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-24 00:49:00,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:49:01,281 INFO L124 PetriNetUnfolderBase]: 1499/2617 cut-off events. [2024-11-24 00:49:01,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:49:01,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4933 conditions, 2617 events. 1499/2617 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16673 event pairs, 188 based on Foata normal form. 100/2672 useless extension candidates. Maximal degree in co-relation 4927. Up to 1316 conditions per place. [2024-11-24 00:49:01,299 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 42 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-11-24 00:49:01,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 228 flow [2024-11-24 00:49:01,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:49:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:49:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-11-24 00:49:01,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-24 00:49:01,302 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 114 transitions. [2024-11-24 00:49:01,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 228 flow [2024-11-24 00:49:01,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:49:01,304 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2024-11-24 00:49:01,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-24 00:49:01,307 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-24 00:49:01,308 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2024-11-24 00:49:01,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-24 00:49:01,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:49:01,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:01,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 00:49:01,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:01,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:49:01,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1809477486, now seen corresponding path program 1 times [2024-11-24 00:49:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:49:01,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915784122] [2024-11-24 00:49:01,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:01,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:01,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:01,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:01,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 00:49:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:01,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 00:49:01,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:49:01,684 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-24 00:49:01,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:49:01,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:49:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915784122] [2024-11-24 00:49:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915784122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:01,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:01,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:49:01,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662289263] [2024-11-24 00:49:01,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:01,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:49:01,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:49:01,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:49:01,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:49:01,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-24 00:49:01,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:49:01,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:49:01,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-24 00:49:01,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:49:02,098 INFO L124 PetriNetUnfolderBase]: 962/1684 cut-off events. [2024-11-24 00:49:02,099 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-11-24 00:49:02,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3790 conditions, 1684 events. 962/1684 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9324 event pairs, 100 based on Foata normal form. 82/1728 useless extension candidates. Maximal degree in co-relation 3781. Up to 581 conditions per place. [2024-11-24 00:49:02,109 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 53 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2024-11-24 00:49:02,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 328 flow [2024-11-24 00:49:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:49:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:49:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-11-24 00:49:02,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-11-24 00:49:02,111 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 144 transitions. [2024-11-24 00:49:02,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 328 flow [2024-11-24 00:49:02,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 318 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-24 00:49:02,114 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2024-11-24 00:49:02,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-24 00:49:02,115 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-24 00:49:02,116 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2024-11-24 00:49:02,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:49:02,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:49:02,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:02,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-24 00:49:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:02,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:49:02,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1732762494, now seen corresponding path program 1 times [2024-11-24 00:49:02,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:49:02,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643446701] [2024-11-24 00:49:02,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:02,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:02,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:02,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:02,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 00:49:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:02,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 00:49:02,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:49:02,539 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-24 00:49:02,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:49:02,542 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:49:02,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643446701] [2024-11-24 00:49:02,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643446701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:02,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:02,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:49:02,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987699347] [2024-11-24 00:49:02,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:02,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:02,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:49:02,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:02,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:02,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-24 00:49:02,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-24 00:49:02,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:49:02,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-24 00:49:02,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:49:02,965 INFO L124 PetriNetUnfolderBase]: 569/961 cut-off events. [2024-11-24 00:49:02,965 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2024-11-24 00:49:02,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 961 events. 569/961 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4365 event pairs, 83 based on Foata normal form. 40/965 useless extension candidates. Maximal degree in co-relation 2465. Up to 308 conditions per place. [2024-11-24 00:49:02,972 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 46 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-11-24 00:49:02,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 335 flow [2024-11-24 00:49:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:49:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:49:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-11-24 00:49:02,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-24 00:49:02,976 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 156 transitions. [2024-11-24 00:49:02,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 335 flow [2024-11-24 00:49:02,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 310 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-24 00:49:02,986 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2024-11-24 00:49:02,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-11-24 00:49:02,988 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-24 00:49:02,990 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2024-11-24 00:49:02,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-24 00:49:02,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:49:02,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:03,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-24 00:49:03,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:03,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:49:03,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:03,195 INFO L85 PathProgramCache]: Analyzing trace with hash -326946703, now seen corresponding path program 1 times [2024-11-24 00:49:03,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:49:03,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352105572] [2024-11-24 00:49:03,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:03,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:03,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:03,198 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:03,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 00:49:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:03,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-24 00:49:03,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:49:03,917 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-24 00:49:03,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:49:03,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:49:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352105572] [2024-11-24 00:49:03,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352105572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:03,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:03,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 00:49:03,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884673267] [2024-11-24 00:49:03,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:03,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:49:03,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:49:03,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:49:03,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:49:03,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-24 00:49:03,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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-24 00:49:03,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:49:03,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-24 00:49:03,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:49:04,660 INFO L124 PetriNetUnfolderBase]: 477/918 cut-off events. [2024-11-24 00:49:04,661 INFO L125 PetriNetUnfolderBase]: For 488/508 co-relation queries the response was YES. [2024-11-24 00:49:04,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 918 events. 477/918 cut-off events. For 488/508 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4698 event pairs, 98 based on Foata normal form. 8/887 useless extension candidates. Maximal degree in co-relation 2149. Up to 256 conditions per place. [2024-11-24 00:49:04,666 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 33 selfloop transitions, 4 changer transitions 28/85 dead transitions. [2024-11-24 00:49:04,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 403 flow [2024-11-24 00:49:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:49:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 00:49:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-11-24 00:49:04,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-11-24 00:49:04,668 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 10 states and 246 transitions. [2024-11-24 00:49:04,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 403 flow [2024-11-24 00:49:04,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 336 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-24 00:49:04,673 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 129 flow [2024-11-24 00:49:04,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=129, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-11-24 00:49:04,674 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-24 00:49:04,674 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 129 flow [2024-11-24 00:49:04,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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-24 00:49:04,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:49:04,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:04,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-24 00:49:04,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:04,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:49:04,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1002893033, now seen corresponding path program 2 times [2024-11-24 00:49:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:49:04,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432065418] [2024-11-24 00:49:04,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:49:04,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:04,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:04,879 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:04,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 00:49:04,984 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:49:04,984 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:49:04,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 00:49:04,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:49:05,064 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-24 00:49:05,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:49:05,064 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:49:05,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432065418] [2024-11-24 00:49:05,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432065418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:05,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:05,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:05,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324152357] [2024-11-24 00:49:05,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:05,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:05,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:49:05,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:05,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:05,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-24 00:49:05,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-24 00:49:05,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:49:05,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-24 00:49:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:49:05,479 INFO L124 PetriNetUnfolderBase]: 717/1359 cut-off events. [2024-11-24 00:49:05,480 INFO L125 PetriNetUnfolderBase]: For 262/270 co-relation queries the response was YES. [2024-11-24 00:49:05,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2947 conditions, 1359 events. 717/1359 cut-off events. For 262/270 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7558 event pairs, 305 based on Foata normal form. 8/1303 useless extension candidates. Maximal degree in co-relation 2934. Up to 625 conditions per place. [2024-11-24 00:49:05,486 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 31 selfloop transitions, 2 changer transitions 17/68 dead transitions. [2024-11-24 00:49:05,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 302 flow [2024-11-24 00:49:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:49:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:49:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-11-24 00:49:05,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-11-24 00:49:05,488 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 129 flow. Second operand 6 states and 147 transitions. [2024-11-24 00:49:05,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 302 flow [2024-11-24 00:49:05,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 276 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-24 00:49:05,492 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 127 flow [2024-11-24 00:49:05,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2024-11-24 00:49:05,493 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-11-24 00:49:05,494 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 127 flow [2024-11-24 00:49:05,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-24 00:49:05,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:49:05,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:05,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-24 00:49:05,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:05,698 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:49:05,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1054353781, now seen corresponding path program 3 times [2024-11-24 00:49:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:49:05,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366292713] [2024-11-24 00:49:05,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 00:49:05,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:05,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:05,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:05,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-24 00:49:05,802 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-24 00:49:05,802 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:49:05,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 00:49:05,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:49:05,888 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-24 00:49:05,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:49:05,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:49:05,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366292713] [2024-11-24 00:49:05,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366292713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:05,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:05,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:05,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798782583] [2024-11-24 00:49:05,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:05,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:05,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:49:05,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:05,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:05,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-24 00:49:05,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-24 00:49:05,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:49:05,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-24 00:49:05,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:49:06,243 INFO L124 PetriNetUnfolderBase]: 578/1116 cut-off events. [2024-11-24 00:49:06,244 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-11-24 00:49:06,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 1116 events. 578/1116 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5710 event pairs, 228 based on Foata normal form. 8/1090 useless extension candidates. Maximal degree in co-relation 2294. Up to 466 conditions per place. [2024-11-24 00:49:06,248 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 26 selfloop transitions, 2 changer transitions 20/66 dead transitions. [2024-11-24 00:49:06,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 286 flow [2024-11-24 00:49:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:49:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:49:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-24 00:49:06,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-11-24 00:49:06,250 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 127 flow. Second operand 6 states and 145 transitions. [2024-11-24 00:49:06,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 286 flow [2024-11-24 00:49:06,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 268 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-24 00:49:06,252 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 129 flow [2024-11-24 00:49:06,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-11-24 00:49:06,256 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2024-11-24 00:49:06,256 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 129 flow [2024-11-24 00:49:06,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-24 00:49:06,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:49:06,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:06,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-24 00:49:06,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:06,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:49:06,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:06,459 INFO L85 PathProgramCache]: Analyzing trace with hash 854874161, now seen corresponding path program 4 times [2024-11-24 00:49:06,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:49:06,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089488039] [2024-11-24 00:49:06,459 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 00:49:06,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:06,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:06,464 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:06,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-24 00:49:06,569 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 00:49:06,569 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 00:49:06,569 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:49:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:49:06,660 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-24 00:49:06,660 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:49:06,661 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-24 00:49:06,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-24 00:49:06,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-24 00:49:06,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-24 00:49:06,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-24 00:49:06,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-24 00:49:06,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-24 00:49:06,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-24 00:49:06,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:06,865 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-24 00:49:06,968 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 00:49:06,968 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:49:06,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:49:06 BasicIcfg [2024-11-24 00:49:06,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:49:06,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:49:06,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:49:06,976 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:49:06,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:48:58" (3/4) ... [2024-11-24 00:49:06,979 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:49:06,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:49:06,981 INFO L158 Benchmark]: Toolchain (without parser) took 10465.68ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 59.1MB in the beginning and 94.2MB in the end (delta: -35.2MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2024-11-24 00:49:06,981 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:49:06,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 714.62ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 35.5MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 00:49:06,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.07ms. Allocated memory is still 83.9MB. Free memory was 35.5MB in the beginning and 33.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:49:06,983 INFO L158 Benchmark]: Boogie Preprocessor took 56.33ms. Allocated memory is still 83.9MB. Free memory was 33.4MB in the beginning and 30.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:49:06,985 INFO L158 Benchmark]: RCFGBuilder took 1019.82ms. Allocated memory is still 83.9MB. Free memory was 30.2MB in the beginning and 36.7MB in the end (delta: -6.5MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-24 00:49:06,986 INFO L158 Benchmark]: TraceAbstraction took 8598.04ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 36.2MB in the beginning and 94.2MB in the end (delta: -58.0MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-24 00:49:06,986 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 94.2MB in the end (delta: 14.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:49:06,987 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 714.62ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 35.5MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.07ms. Allocated memory is still 83.9MB. Free memory was 35.5MB in the beginning and 33.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.33ms. Allocated memory is still 83.9MB. Free memory was 33.4MB in the beginning and 30.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1019.82ms. Allocated memory is still 83.9MB. Free memory was 30.2MB in the beginning and 36.7MB in the end (delta: -6.5MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8598.04ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 36.2MB in the beginning and 94.2MB in the end (delta: -58.0MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 94.2MB in the end (delta: 14.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t745; [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t746; [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745=-2, t746=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t747; [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t745=-2, t746=-1, t747=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745=-2, t746=-1, t747=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745=-2, t746=-1, t747=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745=-2, t746=-1, t747=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix028_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 839]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 313 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1127 IncrementalHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 25 mSDtfsCounter, 1127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 604 SizeOfPredicates, 20 NumberOfNonLiveVariables, 811 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 00:49:07,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7f9ef0d-a0dc-4b12-91e9-64b891c60f59/bin/uautomizer-verify-LYvppIcaGC/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