./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/lazy01.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread/lazy01.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 b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:18:47,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:18:47,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:18:47,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:18:47,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:18:47,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:18:47,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:18:47,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:18:47,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:18:47,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:18:47,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:18:47,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:18:47,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:18:47,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:18:47,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:18:47,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:18:47,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:18:47,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:18:47,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:18:47,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:18:47,949 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:18:47,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:18:47,953 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:18:47,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:18:47,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:18:47,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:18:47,954 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:18:47,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:18:47,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:18:47,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:18:47,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:18:47,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:18:47,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:18:47,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:18:47,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:18:47,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:18:47,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:18:47,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:18:47,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:18:47,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:18:47,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:18:47,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:18:47,958 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 -> b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 [2024-11-19 09:18:48,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:18:48,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:18:48,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:18:48,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:18:48,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:18:48,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/lazy01.i [2024-11-19 09:18:49,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:18:49,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:18:49,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/lazy01.i [2024-11-19 09:18:49,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe59dc23/be6d032b2d1042df95e04b1abe9aa42b/FLAGe3b72e52a [2024-11-19 09:18:50,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe59dc23/be6d032b2d1042df95e04b1abe9aa42b [2024-11-19 09:18:50,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:18:50,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:18:50,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:18:50,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:18:50,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:18:50,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5739a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50, skipping insertion in model container [2024-11-19 09:18:50,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:18:50,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:18:50,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:18:50,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:18:50,831 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:18:50,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50 WrapperNode [2024-11-19 09:18:50,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:18:50,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:18:50,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:18:50,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:18:50,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,877 INFO L138 Inliner]: procedures = 169, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-11-19 09:18:50,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:18:50,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:18:50,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:18:50,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:18:50,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,904 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2024-11-19 09:18:50,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:18:50,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:18:50,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:18:50,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:18:50,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (1/1) ... [2024-11-19 09:18:50,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:18:50,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:18:50,958 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-19 09:18:50,962 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-19 09:18:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:18:51,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:18:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:18:51,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:18:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:18:51,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:18:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:18:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:18:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:18:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:18:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:18:51,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:18:51,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:18:51,008 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:18:51,120 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:18:51,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:18:51,267 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:18:51,267 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:18:51,405 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:18:51,405 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:18:51,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:51 BoogieIcfgContainer [2024-11-19 09:18:51,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:18:51,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:18:51,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:18:51,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:18:51,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:18:50" (1/3) ... [2024-11-19 09:18:51,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da7a43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:18:51, skipping insertion in model container [2024-11-19 09:18:51,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:50" (2/3) ... [2024-11-19 09:18:51,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da7a43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:18:51, skipping insertion in model container [2024-11-19 09:18:51,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:51" (3/3) ... [2024-11-19 09:18:51,415 INFO L112 eAbstractionObserver]: Analyzing ICFG lazy01.i [2024-11-19 09:18:51,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:18:51,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:18:51,432 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:18:51,481 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 09:18:51,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 97 flow [2024-11-19 09:18:51,539 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-19 09:18:51,539 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:18:51,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 2/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-19 09:18:51,543 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 38 transitions, 97 flow [2024-11-19 09:18:51,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 34 transitions, 86 flow [2024-11-19 09:18:51,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:18:51,568 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;@1b12fc6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:18:51,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 09:18:51,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:18:51,579 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2024-11-19 09:18:51,579 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:18:51,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:18:51,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:18:51,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:18:51,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:18:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1771620510, now seen corresponding path program 1 times [2024-11-19 09:18:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:18:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28611536] [2024-11-19 09:18:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:18:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:18:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:18:51,881 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-19 09:18:51,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:18:51,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28611536] [2024-11-19 09:18:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28611536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:18:51,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:18:51,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:18:51,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294808566] [2024-11-19 09:18:51,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:18:51,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:18:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:18:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:18:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:18:51,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:18:51,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-19 09:18:51,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:18:51,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:18:51,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:18:52,197 INFO L124 PetriNetUnfolderBase]: 588/1023 cut-off events. [2024-11-19 09:18:52,197 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-11-19 09:18:52,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 1023 events. 588/1023 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5388 event pairs, 178 based on Foata normal form. 95/1096 useless extension candidates. Maximal degree in co-relation 1849. Up to 827 conditions per place. [2024-11-19 09:18:52,213 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 31 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-11-19 09:18:52,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 178 flow [2024-11-19 09:18:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:18:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:18:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-19 09:18:52,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6403508771929824 [2024-11-19 09:18:52,230 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 86 flow. Second operand 3 states and 73 transitions. [2024-11-19 09:18:52,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 178 flow [2024-11-19 09:18:52,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:18:52,242 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 87 flow [2024-11-19 09:18:52,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-11-19 09:18:52,251 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-11-19 09:18:52,251 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 87 flow [2024-11-19 09:18:52,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-19 09:18:52,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:18:52,252 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:18:52,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:18:52,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:18:52,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:18:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash -895038378, now seen corresponding path program 1 times [2024-11-19 09:18:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:18:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835955827] [2024-11-19 09:18:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:18:52,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:18:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:18:52,423 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-19 09:18:52,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:18:52,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835955827] [2024-11-19 09:18:52,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835955827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:18:52,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:18:52,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:18:52,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817101174] [2024-11-19 09:18:52,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:18:52,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:18:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:18:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:18:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:18:52,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:18:52,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-19 09:18:52,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:18:52,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:18:52,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:18:52,588 INFO L124 PetriNetUnfolderBase]: 303/636 cut-off events. [2024-11-19 09:18:52,589 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 09:18:52,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 636 events. 303/636 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3032 event pairs, 108 based on Foata normal form. 80/709 useless extension candidates. Maximal degree in co-relation 734. Up to 327 conditions per place. [2024-11-19 09:18:52,597 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 28 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-11-19 09:18:52,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 179 flow [2024-11-19 09:18:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:18:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:18:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-19 09:18:52,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2024-11-19 09:18:52,600 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 87 flow. Second operand 3 states and 71 transitions. [2024-11-19 09:18:52,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 179 flow [2024-11-19 09:18:52,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:18:52,603 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 96 flow [2024-11-19 09:18:52,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-11-19 09:18:52,606 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2024-11-19 09:18:52,607 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 96 flow [2024-11-19 09:18:52,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-19 09:18:52,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:18:52,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:18:52,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:18:52,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:18:52,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:18:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1678654816, now seen corresponding path program 1 times [2024-11-19 09:18:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:18:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689067639] [2024-11-19 09:18:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:18:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:18:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:18:52,717 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-19 09:18:52,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:18:52,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689067639] [2024-11-19 09:18:52,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689067639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:18:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:18:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:18:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438794821] [2024-11-19 09:18:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:18:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:18:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:18:52,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:18:52,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:18:52,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:18:52,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-19 09:18:52,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:18:52,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:18:52,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:18:52,876 INFO L124 PetriNetUnfolderBase]: 298/607 cut-off events. [2024-11-19 09:18:52,877 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-19 09:18:52,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 607 events. 298/607 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2824 event pairs, 65 based on Foata normal form. 5/606 useless extension candidates. Maximal degree in co-relation 255. Up to 363 conditions per place. [2024-11-19 09:18:52,881 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 39 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2024-11-19 09:18:52,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 238 flow [2024-11-19 09:18:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:18:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:18:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-11-19 09:18:52,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-11-19 09:18:52,885 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 96 flow. Second operand 4 states and 92 transitions. [2024-11-19 09:18:52,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 238 flow [2024-11-19 09:18:52,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:18:52,888 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 102 flow [2024-11-19 09:18:52,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-11-19 09:18:52,889 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-11-19 09:18:52,889 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 102 flow [2024-11-19 09:18:52,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-19 09:18:52,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:18:52,891 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:18:52,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:18:52,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:18:52,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:18:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2003875104, now seen corresponding path program 1 times [2024-11-19 09:18:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:18:52,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108458710] [2024-11-19 09:18:52,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:18:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:18:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:18:52,967 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-19 09:18:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:18:52,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108458710] [2024-11-19 09:18:52,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108458710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:18:52,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:18:52,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:18:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514401708] [2024-11-19 09:18:52,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:18:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:18:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:18:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:18:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:18:52,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-19 09:18:52,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-19 09:18:52,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:18:52,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-19 09:18:52,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:18:53,112 INFO L124 PetriNetUnfolderBase]: 341/666 cut-off events. [2024-11-19 09:18:53,112 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2024-11-19 09:18:53,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 666 events. 341/666 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3000 event pairs, 91 based on Foata normal form. 4/666 useless extension candidates. Maximal degree in co-relation 508. Up to 316 conditions per place. [2024-11-19 09:18:53,116 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 43 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2024-11-19 09:18:53,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 261 flow [2024-11-19 09:18:53,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:18:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:18:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-11-19 09:18:53,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2024-11-19 09:18:53,122 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 102 flow. Second operand 4 states and 94 transitions. [2024-11-19 09:18:53,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 261 flow [2024-11-19 09:18:53,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 253 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:18:53,125 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 121 flow [2024-11-19 09:18:53,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-11-19 09:18:53,126 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-11-19 09:18:53,126 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 121 flow [2024-11-19 09:18:53,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-19 09:18:53,128 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:18:53,128 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-19 09:18:53,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:18:53,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:18:53,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:18:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1657223266, now seen corresponding path program 1 times [2024-11-19 09:18:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:18:53,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743456578] [2024-11-19 09:18:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:18:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:18:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:18:53,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:18:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:18:53,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:18:53,213 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:18:53,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread3Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-19 09:18:53,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-19 09:18:53,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-19 09:18:53,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-19 09:18:53,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-19 09:18:53,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-11-19 09:18:53,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:18:53,218 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 09:18:53,263 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:18:53,264 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:18:53,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:18:53 BasicIcfg [2024-11-19 09:18:53,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:18:53,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:18:53,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:18:53,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:18:53,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:51" (3/4) ... [2024-11-19 09:18:53,277 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:18:53,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:18:53,279 INFO L158 Benchmark]: Toolchain (without parser) took 3000.93ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 122.0MB in the beginning and 104.2MB in the end (delta: 17.8MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2024-11-19 09:18:53,280 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:18:53,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.17ms. Allocated memory is still 176.2MB. Free memory was 121.5MB in the beginning and 98.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:18:53,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.84ms. Allocated memory is still 176.2MB. Free memory was 98.4MB in the beginning and 96.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:18:53,282 INFO L158 Benchmark]: Boogie Preprocessor took 39.29ms. Allocated memory is still 176.2MB. Free memory was 96.7MB in the beginning and 94.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:18:53,282 INFO L158 Benchmark]: RCFGBuilder took 488.28ms. Allocated memory is still 176.2MB. Free memory was 94.2MB in the beginning and 141.7MB in the end (delta: -47.5MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-19 09:18:53,284 INFO L158 Benchmark]: TraceAbstraction took 1864.89ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 141.7MB in the beginning and 104.2MB in the end (delta: 37.5MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. [2024-11-19 09:18:53,284 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 241.2MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:18:53,285 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 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.17ms. Allocated memory is still 176.2MB. Free memory was 121.5MB in the beginning and 98.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.84ms. Allocated memory is still 176.2MB. Free memory was 98.4MB in the beginning and 96.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.29ms. Allocated memory is still 176.2MB. Free memory was 96.7MB in the beginning and 94.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.28ms. Allocated memory is still 176.2MB. Free memory was 94.2MB in the beginning and 141.7MB in the end (delta: -47.5MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1864.89ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 141.7MB in the beginning and 104.2MB in the end (delta: 37.5MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 241.2MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L703] 0 int data = 0; [L731] 0 pthread_t t1, t2, t3; [L732] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, data=0, mutex={3:0}, t1=-1] [L733] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0] [L734] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0, t3=1] [L707] 1 data++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=1, mutex={3:0}] [L714] 2 data+=2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L721] COND TRUE 3 data >= 3 [L722] CALL 3 reach_error() [L20] COND FALSE 3 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L20] 3 __assert_fail ("0", "lazy01.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] - UnprovableResult [Line: 728]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 732]: 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: 734]: 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: 733]: 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, 63 locations, 6 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: 1.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 212 IncrementalHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=4, InterpolantAutomatonStates: 14, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-19 09:18:53,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread/lazy01.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 b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:18:55,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:18:55,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:18:55,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:18:55,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:18:55,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:18:55,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:18:55,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:18:55,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:18:55,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:18:55,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:18:55,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:18:55,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:18:55,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:18:55,712 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:18:55,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:18:55,713 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:18:55,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:18:55,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:18:55,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:18:55,714 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:18:55,718 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:18:55,718 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:18:55,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:18:55,719 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:18:55,719 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:18:55,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:18:55,720 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:18:55,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:18:55,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:18:55,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:18:55,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:18:55,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:18:55,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:18:55,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:18:55,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:18:55,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:18:55,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:18:55,724 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:18:55,724 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:18:55,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:18:55,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:18:55,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:18:55,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:18:55,725 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 -> b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 [2024-11-19 09:18:56,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:18:56,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:18:56,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:18:56,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:18:56,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:18:56,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/lazy01.i [2024-11-19 09:18:57,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:18:57,970 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:18:57,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/lazy01.i [2024-11-19 09:18:57,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db85e9b3e/b5a321b7728a4e0bac7a0d2d8fa38c28/FLAGe3b07c01d [2024-11-19 09:18:57,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db85e9b3e/b5a321b7728a4e0bac7a0d2d8fa38c28 [2024-11-19 09:18:58,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:18:58,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:18:58,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:18:58,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:18:58,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:18:58,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:18:57" (1/1) ... [2024-11-19 09:18:58,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c644a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58, skipping insertion in model container [2024-11-19 09:18:58,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:18:57" (1/1) ... [2024-11-19 09:18:58,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:18:58,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:18:58,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:18:58,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:18:58,574 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:18:58,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58 WrapperNode [2024-11-19 09:18:58,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:18:58,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:18:58,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:18:58,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:18:58,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,634 INFO L138 Inliner]: procedures = 173, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-19 09:18:58,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:18:58,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:18:58,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:18:58,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:18:58,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,680 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2024-11-19 09:18:58,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:18:58,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:18:58,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:18:58,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:18:58,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (1/1) ... [2024-11-19 09:18:58,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:18:58,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:18:58,746 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-19 09:18:58,762 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-19 09:18:58,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:18:58,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:18:58,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:18:58,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:18:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:18:58,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:18:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:18:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:18:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:18:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:18:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:18:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:18:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:18:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:18:58,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:18:58,808 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:18:58,944 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:18:58,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:18:59,157 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:18:59,157 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:18:59,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:18:59,346 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:18:59,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:59 BoogieIcfgContainer [2024-11-19 09:18:59,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:18:59,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:18:59,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:18:59,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:18:59,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:18:57" (1/3) ... [2024-11-19 09:18:59,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d3778a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:18:59, skipping insertion in model container [2024-11-19 09:18:59,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:58" (2/3) ... [2024-11-19 09:18:59,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d3778a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:18:59, skipping insertion in model container [2024-11-19 09:18:59,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:59" (3/3) ... [2024-11-19 09:18:59,356 INFO L112 eAbstractionObserver]: Analyzing ICFG lazy01.i [2024-11-19 09:18:59,374 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:18:59,375 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:18:59,375 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:18:59,446 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 09:18:59,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 97 flow [2024-11-19 09:18:59,511 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-19 09:18:59,511 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:18:59,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 2/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-19 09:18:59,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 38 transitions, 97 flow [2024-11-19 09:18:59,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 34 transitions, 86 flow [2024-11-19 09:18:59,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:18:59,536 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;@664070ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:18:59,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 09:18:59,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:18:59,550 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2024-11-19 09:18:59,550 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:18:59,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:18:59,551 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:18:59,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:18:59,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:18:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash -252257762, now seen corresponding path program 1 times [2024-11-19 09:18:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:18:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863262761] [2024-11-19 09:18:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:18:59,573 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-19 09:18:59,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:18:59,575 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-19 09:18:59,579 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-19 09:18:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:18:59,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:18:59,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:18:59,743 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-19 09:18:59,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:18:59,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:18:59,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863262761] [2024-11-19 09:18:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863262761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:18:59,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:18:59,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:18:59,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293218859] [2024-11-19 09:18:59,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:18:59,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:18:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:18:59,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:18:59,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:18:59,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:18:59,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-19 09:18:59,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:18:59,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:18:59,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:00,111 INFO L124 PetriNetUnfolderBase]: 588/1023 cut-off events. [2024-11-19 09:19:00,112 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-11-19 09:19:00,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 1023 events. 588/1023 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5390 event pairs, 178 based on Foata normal form. 95/1096 useless extension candidates. Maximal degree in co-relation 1849. Up to 827 conditions per place. [2024-11-19 09:19:00,126 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 31 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-11-19 09:19:00,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 178 flow [2024-11-19 09:19:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:19:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:19:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-19 09:19:00,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6403508771929824 [2024-11-19 09:19:00,139 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 86 flow. Second operand 3 states and 73 transitions. [2024-11-19 09:19:00,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 178 flow [2024-11-19 09:19:00,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:19:00,146 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 87 flow [2024-11-19 09:19:00,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-11-19 09:19:00,152 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-11-19 09:19:00,153 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 87 flow [2024-11-19 09:19:00,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-19 09:19:00,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:00,153 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:00,162 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 (2)] Ended with exit code 0 [2024-11-19 09:19:00,354 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-19 09:19:00,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:19:00,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:00,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1501736296, now seen corresponding path program 1 times [2024-11-19 09:19:00,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:19:00,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178384437] [2024-11-19 09:19:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:00,356 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-19 09:19:00,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:19:00,359 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-19 09:19:00,361 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-19 09:19:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:00,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:19:00,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:19:00,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-19 09:19:00,515 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-19 09:19:00,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:19:00,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:19:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178384437] [2024-11-19 09:19:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178384437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:00,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:19:00,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440478867] [2024-11-19 09:19:00,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:00,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:19:00,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:19:00,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:19:00,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:19:00,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:19:00,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-19 09:19:00,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:00,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:19:00,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:00,695 INFO L124 PetriNetUnfolderBase]: 303/636 cut-off events. [2024-11-19 09:19:00,695 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 09:19:00,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 636 events. 303/636 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3033 event pairs, 108 based on Foata normal form. 80/709 useless extension candidates. Maximal degree in co-relation 734. Up to 327 conditions per place. [2024-11-19 09:19:00,705 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 28 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-11-19 09:19:00,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 179 flow [2024-11-19 09:19:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:19:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:19:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-19 09:19:00,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2024-11-19 09:19:00,711 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 87 flow. Second operand 3 states and 71 transitions. [2024-11-19 09:19:00,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 179 flow [2024-11-19 09:19:00,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:19:00,714 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 96 flow [2024-11-19 09:19:00,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-11-19 09:19:00,715 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2024-11-19 09:19:00,715 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 96 flow [2024-11-19 09:19:00,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-19 09:19:00,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:00,715 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:00,719 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-19 09:19:00,916 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-19 09:19:00,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:19:00,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash 50888544, now seen corresponding path program 1 times [2024-11-19 09:19:00,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:19:00,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599952326] [2024-11-19 09:19:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:00,918 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-19 09:19:00,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:19:00,921 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-19 09:19:00,922 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-19 09:19:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:01,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:19:01,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:19:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:01,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:19:01,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:19:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599952326] [2024-11-19 09:19:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599952326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:19:01,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882021359] [2024-11-19 09:19:01,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:01,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:19:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:19:01,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:19:01,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:19:01,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:19:01,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-19 09:19:01,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:01,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:19:01,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:01,256 INFO L124 PetriNetUnfolderBase]: 298/607 cut-off events. [2024-11-19 09:19:01,258 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-19 09:19:01,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 607 events. 298/607 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2839 event pairs, 65 based on Foata normal form. 5/606 useless extension candidates. Maximal degree in co-relation 255. Up to 363 conditions per place. [2024-11-19 09:19:01,264 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 39 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2024-11-19 09:19:01,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 238 flow [2024-11-19 09:19:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:19:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:19:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-11-19 09:19:01,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-11-19 09:19:01,266 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 96 flow. Second operand 4 states and 92 transitions. [2024-11-19 09:19:01,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 238 flow [2024-11-19 09:19:01,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:19:01,269 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 102 flow [2024-11-19 09:19:01,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-11-19 09:19:01,273 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-11-19 09:19:01,273 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 102 flow [2024-11-19 09:19:01,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-19 09:19:01,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:01,274 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:01,279 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:19:01,474 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-19 09:19:01,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:19:01,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 376108832, now seen corresponding path program 1 times [2024-11-19 09:19:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:19:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140753552] [2024-11-19 09:19:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:01,476 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-19 09:19:01,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:19:01,479 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-19 09:19:01,480 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-19 09:19:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:01,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:19:01,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:19:01,592 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-19 09:19:01,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:19:01,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:19:01,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140753552] [2024-11-19 09:19:01,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140753552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:01,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:01,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:19:01,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594855754] [2024-11-19 09:19:01,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:01,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:19:01,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:19:01,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:19:01,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:19:01,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:19:01,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-19 09:19:01,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:01,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:19:01,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:01,737 INFO L124 PetriNetUnfolderBase]: 294/567 cut-off events. [2024-11-19 09:19:01,737 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-11-19 09:19:01,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 567 events. 294/567 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2527 event pairs, 100 based on Foata normal form. 4/561 useless extension candidates. Maximal degree in co-relation 491. Up to 381 conditions per place. [2024-11-19 09:19:01,741 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 38 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2024-11-19 09:19:01,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 232 flow [2024-11-19 09:19:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:19:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:19:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-11-19 09:19:01,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5986842105263158 [2024-11-19 09:19:01,744 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 102 flow. Second operand 4 states and 91 transitions. [2024-11-19 09:19:01,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 232 flow [2024-11-19 09:19:01,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 224 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:19:01,748 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 106 flow [2024-11-19 09:19:01,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-11-19 09:19:01,749 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-11-19 09:19:01,749 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 106 flow [2024-11-19 09:19:01,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-19 09:19:01,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:01,749 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-19 09:19:01,755 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-19 09:19:01,950 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-19 09:19:01,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:19:01,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1764660510, now seen corresponding path program 1 times [2024-11-19 09:19:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:19:01,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580797456] [2024-11-19 09:19:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:01,951 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-19 09:19:01,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:19:01,955 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-19 09:19:01,956 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-19 09:19:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:19:02,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:19:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:19:02,084 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:19:02,085 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:19:02,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread3Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-19 09:19:02,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-19 09:19:02,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-19 09:19:02,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-19 09:19:02,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-19 09:19:02,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-11-19 09:19:02,098 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-19 09:19:02,293 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-19 09:19:02,294 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 09:19:02,334 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:19:02,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:19:02,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:19:02 BasicIcfg [2024-11-19 09:19:02,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:19:02,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:19:02,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:19:02,345 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:19:02,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:59" (3/4) ... [2024-11-19 09:19:02,347 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:19:02,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:19:02,349 INFO L158 Benchmark]: Toolchain (without parser) took 4347.11ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 35.3MB in the beginning and 40.3MB in the end (delta: -5.0MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-11-19 09:19:02,350 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 54.5MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:19:02,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.74ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 47.6MB in the end (delta: -12.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-19 09:19:02,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.68ms. Allocated memory is still 71.3MB. Free memory was 47.6MB in the beginning and 45.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:19:02,355 INFO L158 Benchmark]: Boogie Preprocessor took 71.38ms. Allocated memory is still 71.3MB. Free memory was 45.5MB in the beginning and 43.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:19:02,355 INFO L158 Benchmark]: RCFGBuilder took 637.88ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 28.8MB in the end (delta: 14.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-19 09:19:02,355 INFO L158 Benchmark]: TraceAbstraction took 2996.03ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 28.4MB in the beginning and 41.4MB in the end (delta: -12.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-19 09:19:02,356 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 104.9MB. Free memory was 41.4MB in the beginning and 40.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:19:02,358 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 54.5MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.74ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 47.6MB in the end (delta: -12.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.68ms. Allocated memory is still 71.3MB. Free memory was 47.6MB in the beginning and 45.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.38ms. Allocated memory is still 71.3MB. Free memory was 45.5MB in the beginning and 43.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 637.88ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 28.8MB in the end (delta: 14.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2996.03ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 28.4MB in the beginning and 41.4MB in the end (delta: -12.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 104.9MB. Free memory was 41.4MB in the beginning and 40.3MB 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: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L703] 0 int data = 0; [L731] 0 pthread_t t1, t2, t3; [L732] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, data=0, mutex={3:0}, t1=-1] [L733] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0] [L734] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0, t3=1] [L707] 1 data++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=1, mutex={3:0}] [L714] 2 data+=2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L721] COND TRUE 3 data >= 3 [L722] CALL 3 reach_error() [L20] COND FALSE 3 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L20] 3 __assert_fail ("0", "lazy01.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] - UnprovableResult [Line: 728]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 732]: 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: 734]: 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: 733]: 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, 63 locations, 6 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: 2.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1 mSDtfsCounter, 256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-19 09:19:02,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample