./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:29:26,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:29:26,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:29:26,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:29:26,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:29:26,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:29:26,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:29:26,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:29:26,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:29:26,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:29:26,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:29:26,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:29:26,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:29:26,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:29:26,364 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:29:26,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:29:26,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:29:26,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:29:26,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:29:26,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:29:26,373 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:29:26,374 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:29:26,374 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:29:26,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:29:26,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:29:26,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:29:26,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:29:26,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:29:26,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:29:26,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:29:26,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:29:26,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:29:26,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:29:26,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:29:26,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:29:26,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:29:26,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:29:26,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:29:26,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:29:26,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:29:26,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:29:26,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:29:26,380 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 [2024-11-20 17:29:26,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:29:26,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:29:26,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:29:26,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:29:26,646 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:29:26,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:29:28,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:29:28,403 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:29:28,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:29:28,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b56459d2/104e84dda403487ba2d45a9a9119127d/FLAG06eb3f754 [2024-11-20 17:29:28,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b56459d2/104e84dda403487ba2d45a9a9119127d [2024-11-20 17:29:28,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:29:28,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:29:28,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:29:28,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:29:28,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:29:28,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:29:28" (1/1) ... [2024-11-20 17:29:28,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7b7bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:28, skipping insertion in model container [2024-11-20 17:29:28,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:29:28" (1/1) ... [2024-11-20 17:29:28,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:29:28,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:29:28,995 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:29:29,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:29:29,121 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:29:29,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29 WrapperNode [2024-11-20 17:29:29,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:29:29,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:29:29,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:29:29,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:29:29,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,195 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-11-20 17:29:29,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:29:29,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:29:29,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:29:29,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:29:29,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,244 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-20 17:29:29,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:29:29,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:29:29,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:29:29,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:29:29,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (1/1) ... [2024-11-20 17:29:29,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:29:29,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:29:29,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:29:29,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:29:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 17:29:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:29:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 17:29:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 17:29:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 17:29:29,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 17:29:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 17:29:29,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 17:29:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:29:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 17:29:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:29:29,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:29:29,368 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:29:29,499 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:29:29,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:29:29,807 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:29:29,810 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:29:30,027 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:29:30,027 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 17:29:30,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:30 BoogieIcfgContainer [2024-11-20 17:29:30,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:29:30,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:29:30,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:29:30,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:29:30,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:29:28" (1/3) ... [2024-11-20 17:29:30,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41db4ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:29:30, skipping insertion in model container [2024-11-20 17:29:30,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:29" (2/3) ... [2024-11-20 17:29:30,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41db4ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:29:30, skipping insertion in model container [2024-11-20 17:29:30,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:30" (3/3) ... [2024-11-20 17:29:30,040 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:29:30,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:29:30,057 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-20 17:29:30,058 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:29:30,123 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:29:30,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-20 17:29:30,194 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-20 17:29:30,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:29:30,198 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 81 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-20 17:29:30,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-20 17:29:30,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-20 17:29:30,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:29:30,228 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;@5f4d83d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:29:30,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 17:29:30,234 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:29:30,234 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-20 17:29:30,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:29:30,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:30,235 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 17:29:30,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1471475717, now seen corresponding path program 1 times [2024-11-20 17:29:30,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:30,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300116970] [2024-11-20 17:29:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:30,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-20 17:29:30,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:30,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300116970] [2024-11-20 17:29:30,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300116970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:30,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:30,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:29:30,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138862789] [2024-11-20 17:29:30,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:30,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:29:30,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:30,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:29:30,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:29:30,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-20 17:29:30,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-20 17:29:30,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:30,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-20 17:29:30,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:31,285 INFO L124 PetriNetUnfolderBase]: 603/1128 cut-off events. [2024-11-20 17:29:31,285 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-20 17:29:31,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 1128 events. 603/1128 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6926 event pairs, 192 based on Foata normal form. 72/1181 useless extension candidates. Maximal degree in co-relation 2076. Up to 742 conditions per place. [2024-11-20 17:29:31,301 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-20 17:29:31,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 180 flow [2024-11-20 17:29:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:29:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:29:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-20 17:29:31,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-11-20 17:29:31,314 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 101 transitions. [2024-11-20 17:29:31,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 180 flow [2024-11-20 17:29:31,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:29:31,321 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-20 17:29:31,324 INFO L260 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-20 17:29:31,328 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-20 17:29:31,329 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-20 17:29:31,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-20 17:29:31,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:31,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:31,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:29:31,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:31,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1371420541, now seen corresponding path program 1 times [2024-11-20 17:29:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:31,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703949626] [2024-11-20 17:29:31,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:31,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:31,392 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-20 17:29:31,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:31,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703949626] [2024-11-20 17:29:31,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703949626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:31,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:31,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:29:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789039076] [2024-11-20 17:29:31,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:31,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:29:31,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:31,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:29:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:29:31,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-20 17:29:31,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:29:31,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:31,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-20 17:29:31,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:31,565 INFO L124 PetriNetUnfolderBase]: 528/1053 cut-off events. [2024-11-20 17:29:31,566 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-20 17:29:31,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1053 events. 528/1053 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6983 event pairs, 528 based on Foata normal form. 36/1040 useless extension candidates. Maximal degree in co-relation 1959. Up to 811 conditions per place. [2024-11-20 17:29:31,575 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-20 17:29:31,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 120 flow [2024-11-20 17:29:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:29:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:29:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-20 17:29:31,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-20 17:29:31,579 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 80 transitions. [2024-11-20 17:29:31,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 120 flow [2024-11-20 17:29:31,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:29:31,580 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-20 17:29:31,581 INFO L260 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-20 17:29:31,581 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-20 17:29:31,581 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-20 17:29:31,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:29:31,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:31,582 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:31,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:29:31,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:31,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1371420682, now seen corresponding path program 1 times [2024-11-20 17:29:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123495448] [2024-11-20 17:29:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:31,823 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-20 17:29:31,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123495448] [2024-11-20 17:29:31,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123495448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:31,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:31,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:29:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272260668] [2024-11-20 17:29:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:31,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:29:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:31,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:29:31,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:29:31,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-20 17:29:31,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-20 17:29:31,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:31,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-20 17:29:31,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:32,217 INFO L124 PetriNetUnfolderBase]: 1213/2140 cut-off events. [2024-11-20 17:29:32,217 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:29:32,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4036 conditions, 2140 events. 1213/2140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13601 event pairs, 147 based on Foata normal form. 80/2185 useless extension candidates. Maximal degree in co-relation 4030. Up to 1081 conditions per place. [2024-11-20 17:29:32,232 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 39 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-11-20 17:29:32,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 218 flow [2024-11-20 17:29:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:29:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:29:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-20 17:29:32,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-20 17:29:32,237 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 115 transitions. [2024-11-20 17:29:32,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 218 flow [2024-11-20 17:29:32,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:29:32,240 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2024-11-20 17:29:32,240 INFO L260 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-20 17:29:32,242 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-20 17:29:32,242 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2024-11-20 17:29:32,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-20 17:29:32,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:32,243 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:32,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:29:32,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:32,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1548275280, now seen corresponding path program 1 times [2024-11-20 17:29:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:32,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640410208] [2024-11-20 17:29:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:32,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:32,530 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-20 17:29:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640410208] [2024-11-20 17:29:32,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640410208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:32,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:32,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:29:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110020687] [2024-11-20 17:29:32,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:32,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:29:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:29:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:29:32,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-20 17:29:32,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-20 17:29:32,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:32,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-20 17:29:32,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:32,827 INFO L124 PetriNetUnfolderBase]: 809/1436 cut-off events. [2024-11-20 17:29:32,827 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-11-20 17:29:32,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1436 events. 809/1436 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8065 event pairs, 73 based on Foata normal form. 68/1476 useless extension candidates. Maximal degree in co-relation 3234. Up to 521 conditions per place. [2024-11-20 17:29:32,835 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2024-11-20 17:29:32,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 314 flow [2024-11-20 17:29:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:29:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:29:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-20 17:29:32,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-11-20 17:29:32,837 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 145 transitions. [2024-11-20 17:29:32,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 314 flow [2024-11-20 17:29:32,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 17:29:32,840 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2024-11-20 17:29:32,840 INFO L260 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-20 17:29:32,841 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-20 17:29:32,841 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2024-11-20 17:29:32,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-20 17:29:32,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:32,842 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:29:32,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 25835863, now seen corresponding path program 1 times [2024-11-20 17:29:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787363159] [2024-11-20 17:29:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:33,120 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-20 17:29:33,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:33,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787363159] [2024-11-20 17:29:33,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787363159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:33,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:33,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:29:33,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194862968] [2024-11-20 17:29:33,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:33,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:29:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:33,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:29:33,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:29:33,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-20 17:29:33,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-20 17:29:33,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:33,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-20 17:29:33,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:33,351 INFO L124 PetriNetUnfolderBase]: 477/820 cut-off events. [2024-11-20 17:29:33,351 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2024-11-20 17:29:33,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 820 events. 477/820 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3761 event pairs, 59 based on Foata normal form. 36/830 useless extension candidates. Maximal degree in co-relation 2122. Up to 268 conditions per place. [2024-11-20 17:29:33,357 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 43 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-11-20 17:29:33,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 325 flow [2024-11-20 17:29:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:29:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:29:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-20 17:29:33,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-20 17:29:33,359 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 159 transitions. [2024-11-20 17:29:33,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 325 flow [2024-11-20 17:29:33,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-20 17:29:33,363 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2024-11-20 17:29:33,363 INFO L260 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-20 17:29:33,364 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-20 17:29:33,364 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2024-11-20 17:29:33,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-20 17:29:33,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:33,365 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:33,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 17:29:33,365 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:33,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:33,366 INFO L85 PathProgramCache]: Analyzing trace with hash 38789686, now seen corresponding path program 1 times [2024-11-20 17:29:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:33,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798658688] [2024-11-20 17:29:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:33,701 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-20 17:29:33,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:33,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798658688] [2024-11-20 17:29:33,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798658688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:33,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:33,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:29:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680935152] [2024-11-20 17:29:33,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:33,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:29:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:29:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:29:33,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-20 17:29:33,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-20 17:29:33,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:33,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-20 17:29:33,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:34,047 INFO L124 PetriNetUnfolderBase]: 672/1274 cut-off events. [2024-11-20 17:29:34,047 INFO L125 PetriNetUnfolderBase]: For 534/554 co-relation queries the response was YES. [2024-11-20 17:29:34,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2858 conditions, 1274 events. 672/1274 cut-off events. For 534/554 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7035 event pairs, 127 based on Foata normal form. 8/1235 useless extension candidates. Maximal degree in co-relation 2846. Up to 558 conditions per place. [2024-11-20 17:29:34,053 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 39 selfloop transitions, 7 changer transitions 16/81 dead transitions. [2024-11-20 17:29:34,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 385 flow [2024-11-20 17:29:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:29:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 17:29:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-11-20 17:29:34,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-20 17:29:34,055 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 7 states and 182 transitions. [2024-11-20 17:29:34,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 385 flow [2024-11-20 17:29:34,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 321 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-20 17:29:34,060 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 149 flow [2024-11-20 17:29:34,061 INFO L260 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-11-20 17:29:34,061 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-11-20 17:29:34,061 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 149 flow [2024-11-20 17:29:34,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-20 17:29:34,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:34,062 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:34,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:29:34,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:34,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1702297072, now seen corresponding path program 2 times [2024-11-20 17:29:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:34,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410941507] [2024-11-20 17:29:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:34,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:35,439 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-20 17:29:35,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410941507] [2024-11-20 17:29:35,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410941507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:35,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:35,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:29:35,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494588155] [2024-11-20 17:29:35,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:35,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:29:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:35,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:29:35,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:29:35,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-20 17:29:35,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 149 flow. Second operand has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 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-20 17:29:35,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:35,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-20 17:29:35,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:35,965 INFO L124 PetriNetUnfolderBase]: 940/1859 cut-off events. [2024-11-20 17:29:35,965 INFO L125 PetriNetUnfolderBase]: For 221/255 co-relation queries the response was YES. [2024-11-20 17:29:35,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 1859 events. 940/1859 cut-off events. For 221/255 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12047 event pairs, 372 based on Foata normal form. 19/1758 useless extension candidates. Maximal degree in co-relation 3835. Up to 485 conditions per place. [2024-11-20 17:29:35,976 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 37 selfloop transitions, 4 changer transitions 19/85 dead transitions. [2024-11-20 17:29:35,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 85 transitions, 377 flow [2024-11-20 17:29:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:29:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 17:29:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-11-20 17:29:35,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6055555555555555 [2024-11-20 17:29:35,978 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 149 flow. Second operand 8 states and 218 transitions. [2024-11-20 17:29:35,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 85 transitions, 377 flow [2024-11-20 17:29:35,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 85 transitions, 367 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-20 17:29:35,981 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 175 flow [2024-11-20 17:29:35,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2024-11-20 17:29:35,982 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2024-11-20 17:29:35,982 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 175 flow [2024-11-20 17:29:35,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 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-20 17:29:35,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:35,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:35,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 17:29:35,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:35,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1790989320, now seen corresponding path program 3 times [2024-11-20 17:29:35,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:35,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782770787] [2024-11-20 17:29:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:36,690 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-20 17:29:36,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:36,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782770787] [2024-11-20 17:29:36,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782770787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:36,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:36,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:29:36,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332860243] [2024-11-20 17:29:36,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:36,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:29:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:36,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:29:36,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:29:36,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-20 17:29:36,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 175 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-20 17:29:36,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:36,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-20 17:29:36,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:37,212 INFO L124 PetriNetUnfolderBase]: 1609/3093 cut-off events. [2024-11-20 17:29:37,212 INFO L125 PetriNetUnfolderBase]: For 1238/1249 co-relation queries the response was YES. [2024-11-20 17:29:37,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7230 conditions, 3093 events. 1609/3093 cut-off events. For 1238/1249 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 21252 event pairs, 370 based on Foata normal form. 27/2953 useless extension candidates. Maximal degree in co-relation 7213. Up to 1199 conditions per place. [2024-11-20 17:29:37,227 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 40 selfloop transitions, 12 changer transitions 24/96 dead transitions. [2024-11-20 17:29:37,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 510 flow [2024-11-20 17:29:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:29:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 17:29:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-11-20 17:29:37,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2024-11-20 17:29:37,229 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 175 flow. Second operand 7 states and 183 transitions. [2024-11-20 17:29:37,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 510 flow [2024-11-20 17:29:37,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 495 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-20 17:29:37,234 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 290 flow [2024-11-20 17:29:37,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2024-11-20 17:29:37,235 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2024-11-20 17:29:37,236 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 290 flow [2024-11-20 17:29:37,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-20 17:29:37,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:37,236 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:37,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 17:29:37,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:37,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1923785386, now seen corresponding path program 4 times [2024-11-20 17:29:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292317598] [2024-11-20 17:29:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:37,467 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-20 17:29:37,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292317598] [2024-11-20 17:29:37,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292317598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:37,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:37,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:29:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200077990] [2024-11-20 17:29:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:37,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:29:37,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:37,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:29:37,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:29:37,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-20 17:29:37,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-20 17:29:37,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:37,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-20 17:29:37,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:37,909 INFO L124 PetriNetUnfolderBase]: 1418/2749 cut-off events. [2024-11-20 17:29:37,909 INFO L125 PetriNetUnfolderBase]: For 2114/2147 co-relation queries the response was YES. [2024-11-20 17:29:37,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6790 conditions, 2749 events. 1418/2749 cut-off events. For 2114/2147 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18722 event pairs, 614 based on Foata normal form. 32/2575 useless extension candidates. Maximal degree in co-relation 6772. Up to 1032 conditions per place. [2024-11-20 17:29:37,924 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 25 selfloop transitions, 4 changer transitions 42/93 dead transitions. [2024-11-20 17:29:37,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 606 flow [2024-11-20 17:29:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:29:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:29:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-11-20 17:29:37,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-20 17:29:37,925 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 290 flow. Second operand 6 states and 155 transitions. [2024-11-20 17:29:37,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 606 flow [2024-11-20 17:29:37,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 586 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-20 17:29:37,931 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 207 flow [2024-11-20 17:29:37,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2024-11-20 17:29:37,932 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2024-11-20 17:29:37,932 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 207 flow [2024-11-20 17:29:37,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-20 17:29:37,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:37,932 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:37,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 17:29:37,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:37,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash 808411618, now seen corresponding path program 5 times [2024-11-20 17:29:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:37,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661932447] [2024-11-20 17:29:37,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:38,169 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-20 17:29:38,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:38,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661932447] [2024-11-20 17:29:38,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661932447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:38,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:29:38,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091813466] [2024-11-20 17:29:38,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:38,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:29:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:29:38,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:29:38,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-20 17:29:38,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 47 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-20 17:29:38,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:38,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-20 17:29:38,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:38,485 INFO L124 PetriNetUnfolderBase]: 851/1685 cut-off events. [2024-11-20 17:29:38,485 INFO L125 PetriNetUnfolderBase]: For 831/831 co-relation queries the response was YES. [2024-11-20 17:29:38,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3862 conditions, 1685 events. 851/1685 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10293 event pairs, 328 based on Foata normal form. 16/1586 useless extension candidates. Maximal degree in co-relation 3842. Up to 601 conditions per place. [2024-11-20 17:29:38,494 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 27 selfloop transitions, 1 changer transitions 29/77 dead transitions. [2024-11-20 17:29:38,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 421 flow [2024-11-20 17:29:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:29:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:29:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-11-20 17:29:38,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5851851851851851 [2024-11-20 17:29:38,496 INFO L175 Difference]: Start difference. First operand has 70 places, 47 transitions, 207 flow. Second operand 6 states and 158 transitions. [2024-11-20 17:29:38,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 421 flow [2024-11-20 17:29:38,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 395 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-11-20 17:29:38,500 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 162 flow [2024-11-20 17:29:38,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2024-11-20 17:29:38,501 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 18 predicate places. [2024-11-20 17:29:38,501 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 162 flow [2024-11-20 17:29:38,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-20 17:29:38,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:38,502 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:38,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 17:29:38,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2002888622, now seen corresponding path program 6 times [2024-11-20 17:29:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267741954] [2024-11-20 17:29:38,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:39,359 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-20 17:29:39,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:29:39,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267741954] [2024-11-20 17:29:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267741954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:39,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:29:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922830405] [2024-11-20 17:29:39,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:39,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:29:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:29:39,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:29:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:29:39,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-20 17:29:39,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 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-20 17:29:39,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:39,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-20 17:29:39,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:39,782 INFO L124 PetriNetUnfolderBase]: 411/859 cut-off events. [2024-11-20 17:29:39,782 INFO L125 PetriNetUnfolderBase]: For 246/252 co-relation queries the response was YES. [2024-11-20 17:29:39,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 859 events. 411/859 cut-off events. For 246/252 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4445 event pairs, 88 based on Foata normal form. 12/811 useless extension candidates. Maximal degree in co-relation 1883. Up to 264 conditions per place. [2024-11-20 17:29:39,788 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 29 selfloop transitions, 7 changer transitions 19/75 dead transitions. [2024-11-20 17:29:39,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 354 flow [2024-11-20 17:29:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:29:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:29:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-11-20 17:29:39,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-11-20 17:29:39,791 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 162 flow. Second operand 10 states and 235 transitions. [2024-11-20 17:29:39,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 354 flow [2024-11-20 17:29:39,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 327 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-11-20 17:29:39,795 INFO L231 Difference]: Finished difference. Result has 71 places, 44 transitions, 177 flow [2024-11-20 17:29:39,796 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=177, PETRI_PLACES=71, PETRI_TRANSITIONS=44} [2024-11-20 17:29:39,796 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2024-11-20 17:29:39,796 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 177 flow [2024-11-20 17:29:39,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 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-20 17:29:39,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:39,798 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:39,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 17:29:39,798 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:39,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1066970196, now seen corresponding path program 7 times [2024-11-20 17:29:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:29:39,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312578721] [2024-11-20 17:29:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:29:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:29:39,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:29:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:29:39,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 17:29:39,934 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:29:39,936 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-20 17:29:39,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-20 17:29:39,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-20 17:29:39,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-20 17:29:39,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-20 17:29:39,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-20 17:29:39,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-20 17:29:39,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 17:29:39,940 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2024-11-20 17:29:40,029 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:29:40,029 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:29:40,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:29:40 BasicIcfg [2024-11-20 17:29:40,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:29:40,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:29:40,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:29:40,036 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:29:40,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:30" (3/4) ... [2024-11-20 17:29:40,038 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:29:40,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:29:40,040 INFO L158 Benchmark]: Toolchain (without parser) took 11597.43ms. Allocated memory was 167.8MB in the beginning and 446.7MB in the end (delta: 278.9MB). Free memory was 93.6MB in the beginning and 297.1MB in the end (delta: -203.6MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. [2024-11-20 17:29:40,040 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:29:40,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.18ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 93.4MB in the beginning and 178.8MB in the end (delta: -85.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-20 17:29:40,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.54ms. Allocated memory is still 222.3MB. Free memory was 178.8MB in the beginning and 176.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:29:40,041 INFO L158 Benchmark]: Boogie Preprocessor took 67.78ms. Allocated memory is still 222.3MB. Free memory was 176.7MB in the beginning and 173.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:29:40,041 INFO L158 Benchmark]: RCFGBuilder took 760.87ms. Allocated memory is still 222.3MB. Free memory was 173.6MB in the beginning and 122.2MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-20 17:29:40,042 INFO L158 Benchmark]: TraceAbstraction took 10003.22ms. Allocated memory was 222.3MB in the beginning and 446.7MB in the end (delta: 224.4MB). Free memory was 121.2MB in the beginning and 298.2MB in the end (delta: -177.0MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-11-20 17:29:40,042 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 446.7MB. Free memory was 298.2MB in the beginning and 297.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:29:40,046 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.20ms. Allocated memory is still 167.8MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 678.18ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 93.4MB in the beginning and 178.8MB in the end (delta: -85.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.54ms. Allocated memory is still 222.3MB. Free memory was 178.8MB in the beginning and 176.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.78ms. Allocated memory is still 222.3MB. Free memory was 176.7MB in the beginning and 173.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 760.87ms. Allocated memory is still 222.3MB. Free memory was 173.6MB in the beginning and 122.2MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10003.22ms. Allocated memory was 222.3MB in the beginning and 446.7MB in the end (delta: 224.4MB). Free memory was 121.2MB in the beginning and 298.2MB in the end (delta: -177.0MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 446.7MB. Free memory was 298.2MB in the beginning and 297.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=-1, t2346=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=-1, t2346=0, t2347=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=-1, t2346=0, t2347=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=-1, t2346=0, t2347=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=-1, t2346=0, t2347=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 9.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 506 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1496 IncrementalHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 35 mSDtfsCounter, 1496 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 1809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 17:29:40,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:29:42,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:29:42,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:29:42,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:29:42,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:29:42,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:29:42,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:29:42,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:29:42,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:29:42,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:29:42,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:29:42,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:29:42,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:29:42,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:29:42,379 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:29:42,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:29:42,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:29:42,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:29:42,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:29:42,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:29:42,381 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:29:42,384 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:29:42,385 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:29:42,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:29:42,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:29:42,385 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:29:42,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:29:42,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:29:42,386 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:29:42,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:29:42,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:29:42,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:29:42,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:29:42,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:29:42,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:29:42,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:29:42,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:29:42,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:29:42,390 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:29:42,390 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:29:42,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:29:42,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:29:42,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:29:42,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:29:42,392 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 [2024-11-20 17:29:42,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:29:42,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:29:42,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:29:42,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:29:42,738 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:29:42,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:29:44,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:29:44,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:29:44,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:29:44,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d8435f8/eb0a2449bd9e4063829e9584df981bdf/FLAG8e29bcdbe [2024-11-20 17:29:44,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d8435f8/eb0a2449bd9e4063829e9584df981bdf [2024-11-20 17:29:44,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:29:44,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:29:44,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:29:44,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:29:44,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:29:44,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:29:44" (1/1) ... [2024-11-20 17:29:44,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9b5dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:44, skipping insertion in model container [2024-11-20 17:29:44,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:29:44" (1/1) ... [2024-11-20 17:29:44,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:29:45,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:29:45,108 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:29:45,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:29:45,246 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:29:45,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45 WrapperNode [2024-11-20 17:29:45,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:29:45,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:29:45,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:29:45,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:29:45,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,314 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-11-20 17:29:45,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:29:45,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:29:45,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:29:45,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:29:45,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,358 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-20 17:29:45,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:29:45,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:29:45,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:29:45,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:29:45,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (1/1) ... [2024-11-20 17:29:45,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:29:45,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:29:45,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:29:45,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:29:45,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 17:29:45,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:29:45,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:29:45,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 17:29:45,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 17:29:45,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 17:29:45,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 17:29:45,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 17:29:45,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 17:29:45,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 17:29:45,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:29:45,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:29:45,474 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:29:45,624 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:29:45,626 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:29:45,969 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:29:45,970 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:29:46,188 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:29:46,189 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 17:29:46,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:46 BoogieIcfgContainer [2024-11-20 17:29:46,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:29:46,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:29:46,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:29:46,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:29:46,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:29:44" (1/3) ... [2024-11-20 17:29:46,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1491474c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:29:46, skipping insertion in model container [2024-11-20 17:29:46,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:45" (2/3) ... [2024-11-20 17:29:46,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1491474c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:29:46, skipping insertion in model container [2024-11-20 17:29:46,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:46" (3/3) ... [2024-11-20 17:29:46,201 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:29:46,218 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:29:46,218 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-20 17:29:46,219 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:29:46,284 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:29:46,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-20 17:29:46,350 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-20 17:29:46,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:29:46,354 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 81 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-20 17:29:46,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-20 17:29:46,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-20 17:29:46,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:29:46,389 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;@67cd4c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:29:46,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 17:29:46,394 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:29:46,395 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-20 17:29:46,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:29:46,395 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:46,396 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 17:29:46,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:46,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1412308805, now seen corresponding path program 1 times [2024-11-20 17:29:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:29:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226215330] [2024-11-20 17:29:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:46,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:29:46,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:29:46,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 17:29:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:46,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:29:46,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:29:46,564 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-20 17:29:46,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:29:46,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:29:46,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226215330] [2024-11-20 17:29:46,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226215330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:46,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:46,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:29:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298749497] [2024-11-20 17:29:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:46,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:29:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:29:46,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:29:46,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:29:46,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-20 17:29:46,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-20 17:29:46,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:46,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-20 17:29:46,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:46,975 INFO L124 PetriNetUnfolderBase]: 603/1152 cut-off events. [2024-11-20 17:29:46,976 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-20 17:29:46,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 1152 events. 603/1152 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7466 event pairs, 96 based on Foata normal form. 72/1205 useless extension candidates. Maximal degree in co-relation 2100. Up to 742 conditions per place. [2024-11-20 17:29:46,987 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-20 17:29:46,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 180 flow [2024-11-20 17:29:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:29:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:29:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-20 17:29:46,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-11-20 17:29:47,001 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 101 transitions. [2024-11-20 17:29:47,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 180 flow [2024-11-20 17:29:47,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:29:47,006 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-20 17:29:47,009 INFO L260 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-20 17:29:47,012 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-20 17:29:47,012 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-20 17:29:47,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-20 17:29:47,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:47,012 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:47,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 17:29:47,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:47,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:47,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:47,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1978118459, now seen corresponding path program 1 times [2024-11-20 17:29:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:29:47,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783319710] [2024-11-20 17:29:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:47,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:47,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:29:47,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:29:47,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 17:29:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:47,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:29:47,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:29:47,362 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-20 17:29:47,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:29:47,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:29:47,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783319710] [2024-11-20 17:29:47,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783319710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:29:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225952158] [2024-11-20 17:29:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:47,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:29:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:29:47,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:29:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:29:47,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-20 17:29:47,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-20 17:29:47,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:47,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-20 17:29:47,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:47,784 INFO L124 PetriNetUnfolderBase]: 1361/2424 cut-off events. [2024-11-20 17:29:47,784 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-20 17:29:47,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4664 conditions, 2424 events. 1361/2424 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15829 event pairs, 147 based on Foata normal form. 80/2469 useless extension candidates. Maximal degree in co-relation 4654. Up to 1297 conditions per place. [2024-11-20 17:29:47,802 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 40 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-11-20 17:29:47,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 230 flow [2024-11-20 17:29:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:29:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:29:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-20 17:29:47,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-11-20 17:29:47,805 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 4 states and 116 transitions. [2024-11-20 17:29:47,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 230 flow [2024-11-20 17:29:47,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:29:47,807 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 114 flow [2024-11-20 17:29:47,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-11-20 17:29:47,808 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-20 17:29:47,808 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 114 flow [2024-11-20 17:29:47,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-20 17:29:47,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:47,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:47,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 17:29:48,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:48,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:48,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:48,011 INFO L85 PathProgramCache]: Analyzing trace with hash -675191619, now seen corresponding path program 1 times [2024-11-20 17:29:48,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:29:48,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315481514] [2024-11-20 17:29:48,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:48,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:48,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:29:48,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:29:48,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 17:29:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:48,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:29:48,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:29:48,138 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-20 17:29:48,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:29:48,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:29:48,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315481514] [2024-11-20 17:29:48,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315481514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:48,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:48,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:29:48,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782058883] [2024-11-20 17:29:48,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:48,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:29:48,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:29:48,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:29:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:29:48,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-20 17:29:48,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-20 17:29:48,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:48,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-20 17:29:48,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:48,502 INFO L124 PetriNetUnfolderBase]: 877/1576 cut-off events. [2024-11-20 17:29:48,502 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2024-11-20 17:29:48,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1576 events. 877/1576 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9051 event pairs, 73 based on Foata normal form. 68/1616 useless extension candidates. Maximal degree in co-relation 3486. Up to 625 conditions per place. [2024-11-20 17:29:48,512 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 50 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2024-11-20 17:29:48,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 319 flow [2024-11-20 17:29:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:29:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:29:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-11-20 17:29:48,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-11-20 17:29:48,517 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 114 flow. Second operand 5 states and 146 transitions. [2024-11-20 17:29:48,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 319 flow [2024-11-20 17:29:48,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 17:29:48,522 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 154 flow [2024-11-20 17:29:48,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-11-20 17:29:48,523 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2024-11-20 17:29:48,524 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 154 flow [2024-11-20 17:29:48,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-20 17:29:48,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:48,525 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:48,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 17:29:48,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:48,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:48,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash -258427162, now seen corresponding path program 1 times [2024-11-20 17:29:48,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:29:48,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032996112] [2024-11-20 17:29:48,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:48,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:48,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:29:48,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:29:48,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 17:29:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:48,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:29:48,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:29:48,869 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-20 17:29:48,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:29:48,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:29:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032996112] [2024-11-20 17:29:48,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032996112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:48,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:48,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:29:48,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847323864] [2024-11-20 17:29:48,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:48,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:29:48,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:29:48,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:29:48,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:29:48,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-20 17:29:48,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-20 17:29:48,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:48,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-20 17:29:48,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:49,239 INFO L124 PetriNetUnfolderBase]: 489/848 cut-off events. [2024-11-20 17:29:49,239 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2024-11-20 17:29:49,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 848 events. 489/848 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3898 event pairs, 59 based on Foata normal form. 36/858 useless extension candidates. Maximal degree in co-relation 2166. Up to 268 conditions per place. [2024-11-20 17:29:49,245 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 44 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-11-20 17:29:49,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 330 flow [2024-11-20 17:29:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:29:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:29:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-11-20 17:29:49,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-20 17:29:49,249 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 154 flow. Second operand 6 states and 160 transitions. [2024-11-20 17:29:49,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 330 flow [2024-11-20 17:29:49,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-20 17:29:49,256 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 168 flow [2024-11-20 17:29:49,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-11-20 17:29:49,258 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-20 17:29:49,258 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 168 flow [2024-11-20 17:29:49,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-20 17:29:49,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:49,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:49,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 17:29:49,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:49,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:49,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash -954210555, now seen corresponding path program 1 times [2024-11-20 17:29:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:29:49,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028367291] [2024-11-20 17:29:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:49,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:49,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:29:49,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:29:49,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 17:29:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:49,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:29:49,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:29:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:29:49,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:29:49,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:29:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028367291] [2024-11-20 17:29:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028367291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:49,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:49,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:29:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218268327] [2024-11-20 17:29:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:49,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:29:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:29:49,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:29:49,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:29:49,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-20 17:29:49,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-20 17:29:49,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:49,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-20 17:29:49,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:49,705 INFO L124 PetriNetUnfolderBase]: 247/526 cut-off events. [2024-11-20 17:29:49,705 INFO L125 PetriNetUnfolderBase]: For 161/166 co-relation queries the response was YES. [2024-11-20 17:29:49,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 526 events. 247/526 cut-off events. For 161/166 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2653 event pairs, 237 based on Foata normal form. 8/482 useless extension candidates. Maximal degree in co-relation 1117. Up to 402 conditions per place. [2024-11-20 17:29:49,709 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/42 dead transitions. [2024-11-20 17:29:49,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 42 transitions, 204 flow [2024-11-20 17:29:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:29:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:29:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-20 17:29:49,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-20 17:29:49,710 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 168 flow. Second operand 3 states and 80 transitions. [2024-11-20 17:29:49,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 42 transitions, 204 flow [2024-11-20 17:29:49,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 148 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-20 17:29:49,713 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 110 flow [2024-11-20 17:29:49,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-11-20 17:29:49,714 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-20 17:29:49,714 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 110 flow [2024-11-20 17:29:49,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-20 17:29:49,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:49,715 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:49,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 17:29:49,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:49,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:49,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1784124426, now seen corresponding path program 1 times [2024-11-20 17:29:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:29:49,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960462719] [2024-11-20 17:29:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:29:49,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:49,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:29:49,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:29:49,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 17:29:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:29:50,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:29:50,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:29:50,076 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-20 17:29:50,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:29:50,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:29:50,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960462719] [2024-11-20 17:29:50,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960462719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:50,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:50,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:29:50,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042095272] [2024-11-20 17:29:50,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:50,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:29:50,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:29:50,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:29:50,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:29:50,092 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-20 17:29:50,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-20 17:29:50,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:50,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-20 17:29:50,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:50,348 INFO L124 PetriNetUnfolderBase]: 614/1203 cut-off events. [2024-11-20 17:29:50,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:29:50,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2318 conditions, 1203 events. 614/1203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6728 event pairs, 130 based on Foata normal form. 8/1163 useless extension candidates. Maximal degree in co-relation 2311. Up to 500 conditions per place. [2024-11-20 17:29:50,354 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 26 selfloop transitions, 1 changer transitions 23/70 dead transitions. [2024-11-20 17:29:50,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 272 flow [2024-11-20 17:29:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:29:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:29:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-20 17:29:50,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-20 17:29:50,355 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 110 flow. Second operand 6 states and 159 transitions. [2024-11-20 17:29:50,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 272 flow [2024-11-20 17:29:50,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:29:50,357 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 120 flow [2024-11-20 17:29:50,357 INFO L260 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-11-20 17:29:50,359 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-20 17:29:50,359 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 120 flow [2024-11-20 17:29:50,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-20 17:29:50,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:50,360 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:50,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 17:29:50,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:50,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:50,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:50,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1866175402, now seen corresponding path program 2 times [2024-11-20 17:29:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:29:50,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682681678] [2024-11-20 17:29:50,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:29:50,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:29:50,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:29:50,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 17:29:50,658 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:29:50,659 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:29:50,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 17:29:50,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:29:51,067 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-20 17:29:51,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:29:51,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:29:51,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682681678] [2024-11-20 17:29:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682681678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:51,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:51,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:29:51,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380480608] [2024-11-20 17:29:51,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:51,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:29:51,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:29:51,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:29:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:29:51,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-20 17:29:51,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 120 flow. Second operand has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 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-20 17:29:51,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:51,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-20 17:29:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:51,465 INFO L124 PetriNetUnfolderBase]: 419/870 cut-off events. [2024-11-20 17:29:51,466 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 17:29:51,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 870 events. 419/870 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4674 event pairs, 93 based on Foata normal form. 8/828 useless extension candidates. Maximal degree in co-relation 1718. Up to 189 conditions per place. [2024-11-20 17:29:51,473 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 27 selfloop transitions, 4 changer transitions 23/76 dead transitions. [2024-11-20 17:29:51,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 308 flow [2024-11-20 17:29:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:29:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:29:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions. [2024-11-20 17:29:51,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2024-11-20 17:29:51,475 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 120 flow. Second operand 9 states and 235 transitions. [2024-11-20 17:29:51,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 308 flow [2024-11-20 17:29:51,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 297 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 17:29:51,478 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 131 flow [2024-11-20 17:29:51,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=9, PETRI_FLOW=131, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-11-20 17:29:51,479 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-20 17:29:51,479 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 131 flow [2024-11-20 17:29:51,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 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-20 17:29:51,480 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:51,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:51,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-20 17:29:51,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:51,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:51,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1446377550, now seen corresponding path program 3 times [2024-11-20 17:29:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:29:51,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105461258] [2024-11-20 17:29:51,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 17:29:51,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:29:51,691 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:29:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 17:29:51,782 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-20 17:29:51,783 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:29:51,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:29:51,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:29:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:29:51,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:29:51,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:29:51,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105461258] [2024-11-20 17:29:51,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105461258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:29:51,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:29:51,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:29:51,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867091240] [2024-11-20 17:29:51,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:29:51,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:29:51,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:29:51,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:29:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:29:51,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-20 17:29:51,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-20 17:29:51,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:29:51,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-20 17:29:51,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:29:52,069 INFO L124 PetriNetUnfolderBase]: 537/1084 cut-off events. [2024-11-20 17:29:52,070 INFO L125 PetriNetUnfolderBase]: For 194/196 co-relation queries the response was YES. [2024-11-20 17:29:52,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 1084 events. 537/1084 cut-off events. For 194/196 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6115 event pairs, 215 based on Foata normal form. 8/1033 useless extension candidates. Maximal degree in co-relation 2356. Up to 329 conditions per place. [2024-11-20 17:29:52,075 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 22 selfloop transitions, 3 changer transitions 21/66 dead transitions. [2024-11-20 17:29:52,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 289 flow [2024-11-20 17:29:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:29:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:29:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-11-20 17:29:52,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-20 17:29:52,077 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 131 flow. Second operand 6 states and 155 transitions. [2024-11-20 17:29:52,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 289 flow [2024-11-20 17:29:52,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 267 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-20 17:29:52,080 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 131 flow [2024-11-20 17:29:52,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=131, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-11-20 17:29:52,081 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2024-11-20 17:29:52,081 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 131 flow [2024-11-20 17:29:52,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-20 17:29:52,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:29:52,082 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:29:52,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-20 17:29:52,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:52,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:29:52,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:29:52,283 INFO L85 PathProgramCache]: Analyzing trace with hash -374542244, now seen corresponding path program 4 times [2024-11-20 17:29:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:29:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733722810] [2024-11-20 17:29:52,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 17:29:52,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:52,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:29:52,288 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:29:52,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 17:29:52,379 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 17:29:52,379 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-20 17:29:52,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:29:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:29:52,491 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 17:29:52,491 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:29:52,492 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-20 17:29:52,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-20 17:29:52,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-20 17:29:52,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-20 17:29:52,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-20 17:29:52,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-20 17:29:52,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-20 17:29:52,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 17:29:52,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:29:52,697 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-20 17:29:52,792 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:29:52,792 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:29:52,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:29:52 BasicIcfg [2024-11-20 17:29:52,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:29:52,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:29:52,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:29:52,797 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:29:52,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:46" (3/4) ... [2024-11-20 17:29:52,801 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:29:52,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:29:52,803 INFO L158 Benchmark]: Toolchain (without parser) took 8167.11ms. Allocated memory was 71.3MB in the beginning and 188.7MB in the end (delta: 117.4MB). Free memory was 51.9MB in the beginning and 66.4MB in the end (delta: -14.5MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2024-11-20 17:29:52,803 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 48.2MB. Free memory was 29.4MB in the beginning and 29.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:29:52,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.87ms. Allocated memory is still 71.3MB. Free memory was 51.7MB in the beginning and 45.6MB in the end (delta: 6.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-20 17:29:52,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.12ms. Allocated memory is still 71.3MB. Free memory was 45.6MB in the beginning and 43.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:29:52,804 INFO L158 Benchmark]: Boogie Preprocessor took 67.98ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 39.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:29:52,804 INFO L158 Benchmark]: RCFGBuilder took 802.37ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 39.7MB in the beginning and 42.9MB in the end (delta: -3.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-20 17:29:52,804 INFO L158 Benchmark]: TraceAbstraction took 6603.08ms. Allocated memory was 92.3MB in the beginning and 188.7MB in the end (delta: 96.5MB). Free memory was 42.2MB in the beginning and 66.4MB in the end (delta: -24.2MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2024-11-20 17:29:52,805 INFO L158 Benchmark]: Witness Printer took 5.78ms. Allocated memory is still 188.7MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:29:52,806 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.92ms. Allocated memory is still 48.2MB. Free memory was 29.4MB in the beginning and 29.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 608.87ms. Allocated memory is still 71.3MB. Free memory was 51.7MB in the beginning and 45.6MB in the end (delta: 6.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.12ms. Allocated memory is still 71.3MB. Free memory was 45.6MB in the beginning and 43.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.98ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 39.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 802.37ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 39.7MB in the beginning and 42.9MB in the end (delta: -3.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6603.08ms. Allocated memory was 92.3MB in the beginning and 188.7MB in the end (delta: 96.5MB). Free memory was 42.2MB in the beginning and 66.4MB in the end (delta: -24.2MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Witness Printer took 5.78ms. Allocated memory is still 188.7MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2345=0, t2346=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2345=0, t2346=1, t2347=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=0, t2346=1, t2347=2, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=0, t2346=1, t2347=2, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=0, t2346=1, t2347=2, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 6.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 984 IncrementalHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 5 mSDtfsCounter, 984 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=4, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 708 SizeOfPredicates, 14 NumberOfNonLiveVariables, 866 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 17:29:52,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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